title: Proof the language is regular or not regular using Pumping lemma?
body: <p>Can any one help to figure out that L = { a<sup>m</sup> b<sup>n</sup>, m &ge; n + 2, m &le; 3 } is regular or not using pumping lemma, It seems to be a bit difficult to prove.  </p>
  
  <p>I have tried to used pumping lemma and it shows that it is regular language but i am really confused that is this right or not.</p>