Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous using the string (abc) by using substitutions. b. Then design a push down automata that recognizes the language. C. Then show the tracing of (abc, abbccc) using the push down automata. d. Then Show which two simple languages create the greater language. Give set builder notation for each language. e. Then produce Chomsky normal form for the grammar. The following context-free language is inherently ambiguous [a b c n m v m=l} = It is generated by the following (ambiguous) grammar SAB A Ac C -> BaB D CaCb E DbDc E