Please write the answers clear and easy to be read and please sipirt the answers so It would be in order Problem i (5 points). Show that the language L (: w {0, l}, is a palindrome) is not regular Problem 2 (5 points). Show that the language L {0n1mOnm, n > 0} is not regular. Problem 3 (5 points). Show that the language L - [www : w E 10,1j*} is not regular. Hint: Consider the string w 0P1. Problem 4 (5 points). Design a context-free grammar for the language L-{w : w contains more 0s than 1s}