Consider the following grammar:

$<$ assign $>-><$ id $>=<$ expr $>$

$<$ id $>->$ A $|$ B $|$ C

$<$ expr $>-><$ id $>+<$ expr $>$

$|<$ id $>*<$ expr $>$

$|(<$ expr $>)$

$|<$ id $>$

Show parse tree and leftmost derivation of the two statements:

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

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