Answer this computer science question

1a)

1. Show that the following grammar is ambiguous. (To show that 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 |

b)

1. Give an unambiguous grammar for the same language generated by the grammar below:

The grammar G2, shown below:

::= |

::= wilma | betty |

::= fred | barney |