Show that the following grammar is ambiguous. Note: The terminals symbols are in bold.Using the grammar below, show a parse tree and a leftmost derivation for the sentence

$B=(A+C)**B$

$=$

$*$

$l$

$+-$

I

$()$

$l$

$,A|B|C$

Rewrite the following BNF to add the postfix $++$ and $--$ unary operators of Java.

term $>$

$|$ factor$>$

$()$

$l$

$,A|B|C$ expr $>$

$*$

$l$

$$ factor $>+$ term $>|>-$ term $>$

$|$ factor$>$

$()$

$l$

$,A|B|C>$ expr $>$

$*$

$l$

$$ factor $>+$ term $>|>-$ term $>$

$|$ factor$>$

$()$

$l$

$,A|B|C$