3) This proof attempts to show that L = { 01 | i>>>0} is not regular. The proof is flawed. Identify the reason that the proof is flawed. Proof: Assume that L is regular and let p=10 be the pumping length. Let s = 0,2010 s can be split into xyz, satisfying these conditions: 1. For each i 2 0, xyz L, 2. lyl > 0, and 3. (xyl sp. In splits of s into xyz, y=0+ because of condition 3 then xz has less zeros then s and xz L. This contradicts condition 1, therefore L is not regular. 4) Show that the language A is not regular. A = {ww | W {0,1}"} Another way to describe strings in A is that every string in A can be split in half where the first half is equal to the second half Examples of strings in Aare (00, 11, 0000,0101, 1010, 1111,1111, ....)