Determine whether the following grammar is ambiguous. If so, show two different derivation trees for the same string of terminals, and show a left-most derivation corre-sponding to each tree.

Input / Question:

Verified

Output/Answer

We note that the two derviation trees correspond to two different left-most derivations, and the grammar is ambiguous.