Problem $1$: Consider following CFG:

E$->$E$+$T $|$ T

T$->$T$*$F $|$ F

E$->($E$)|$ a

Give left most derivation and parse trees of the following strings:

a

a $*($a $+$ a$)$

a $+$ a $+$ a

$(($a $+$ a$)*($a $*$ a$))$