Exercise 3 Show that each of the following grammars is ambiguous. (To show that a grammar is ambiguous, you must demonstrate that it can generate two parse trees for the same string.) a. The grammar G4, repeated here: exp sexp> b. This grammar: : := woman> | ::- wilma | betty C. The following grammar for strings of balanced parentheses. (A language of any number of different kinds of balanced parentheses is called a Dyck lan guage. This type of language plays an interesting role in the theory of formal languages.) (O