Question $17$

$10$ pts

Prove that the following grammar is ambiguous: $->()|$ a

To do so$,$ you need to specify a string of terminals $($which are $\text{'}$a$\text{'},\text{'}(\text{'},$ and $\text{'}))$ that can be parsed in two different ways by this grammar. To show the ambiguity, you need to either write two different left$-$most derivatives for the string or draw two different parse trees for the string