Proof the following using the Pumping Lemma - by Contradiction.

All of the L's below are not regular.

DO NOT COPY THE SOLUTION FROM CHEGG'S Q&A. Please answer your own

Fundamental rules of Pumping Lemma since some of answers I previous got was wrong fundamently

1 - |xy| <= P

2 - |y| >= 1

3- xy^kz in the language for all k >= 0

Questions:

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

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