Use the pumping lemma and contradiction to prove languages are not regular.

1. Using the pumping lemma and contradiction, prove that L={a2b2mn>=0} is not regular. 2. Using the pumping lemma and contradiction, prove that L={a0bmn>m} is not regular. 3. Using the pumping lemma and contradiction, prove that L={anbmn