Give a CNF grammar which generates L. Is it ambigous, give two different parse trees for iwiaea.

Let L be the language generated by the context-free grammar 2. S-S 3. S-is A. S iSeS (a) [20 points] Give a CNF grammar which generates L (b) [20 points Is your CNF grammar ambiguous? If so, prove it is ambigous by giving two different parse trees for iwiaea using that CNF grammar