1. Show that the following grammar is ambiguous. (To show that a grammar is ambiguous, you must demonstrate that it can generate two parse trees for the same string.)

The grammar G2, shown below:

::= |

::= wilma | betty |

::= fred | barney |