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:

G4: ::= % | + | ( ) | x | y

b. This grammar:

::= |

::= apple | banana |

::= chips | candy |