Let G be the grammar below

$G$:

$SE$

$EE+T|T||$

$T{T}^{**}F|F||$

$Fa|b|c|N|(E)$

$ND|DN||$

$D0|1|2|3|4|5|6|7|8|9||$

a$.$ Give left$-$most derivation of the string $w=a+{23}^{**}b+c.$ Put one step per line. Make one replacement per line and always underline the variable being replaced. How many steps did your leftmost derivation need?. Count the first S $.$

b$.$ Hand draw a parse tree for $w=15**(a+b)+8+c$ starting from S $.$ How many nodes does your parse tree have? Count every variable and every terminal. Paste your parse tree into Homework $5.$