Theorem 1 (The Pumping Lemma) If L is a regular language, then 3 number p where, if s is any string in L of length at least p, then s may be divided into 3 substrings, s= xyz, su (a) for each i 2 0, ay'z e L (b) lvl>o 3. As we know, a language is regular if there is a Finite State Machine that accepts it. Prove the following language is not regular (Hint: You may want to start out assuming that L is regular, then use the pumping lemma. You know that Iryl K p and state the contents of substring y, now continue using the pumping lemma.)