Consider the context free grammar G = (S. {(.)),R,S) where R is given by a) G is in Chomsky Normal Form (circle one) b) Give the parse tree for (0)00 T F c) There is exactly one parse tree for every string the language. (circle one) T F If your answer is true, explain your reasoning. If your answer is false, give two different parse trees for the same string. d) Prove that L(G) is not regular by using the pumping lemma