Using the Pumping Lemma for Regular Languages. Solve the flowing:

1. Prove that the language L1 = {a"b" | n >0} is not regular. 2. Prove that the language L2 = {wwR | We {a,b}} is not regular. 3. Prove that the language L3 = {a" 62 n > 0} is not regular