3. Use the Pumping Lemma to prove that each of the following languages is not regular. In each case, the alphabet is the set ={0,1}. (a) L={ss=(s)}, where (s) denotes the reverse of the string s : that is, (1n)= n1 for i. (b) L={ss is a power of 2}