Given grammar G: (capital letters are non-terminals, everything else is a terminal) S rightarrow A/S # S | S @ S A rightarrow C|C A C rightarrow a|b|c for each of the strings below: If it is in L(G) prove it by giving both a derivation, and a parse tree. If it is ambiguous demonstrate that fact with parse trees. If it is not in L(G) say so and explain why A. aa # bb B. a @ b # c C. ab Rewrite the grammar G above so that no string in its language is ambiguous. Make # have higher precedence than @ and make both # and @ be left-associative, i.e. a # b # c should mean (a # b) # c