Problem 4. [20 points) a. [8 points) Prove that the language L={1'01'i >0} is not regular using the pumping lemma. b. [7 points) A palindrome is a string that is equal to its reverse (i.e. it reads the same forward and backward, for example the strings 0, 11, 101, 1001 are palindromes). Prove that the set of binary strings that are palindromes is not a regular language. c. [5 points) Prove that the set of binary strings that are not palindromes is not a regular language