Proof the following using the Pumping Lemma - by Contradiction.

All of the L's below are not regular.

1 - L = { w | w =XX^R} language = {0,1} R = reverse. Even number of symbols

2 - L = { 1^n!, for all n >= 0 }

3 - L = { 1^prime | prime carry prime numbers} smallest prime is 2 and largest is Infinity