$($a$)$ Indicate what the context$-$free grammar below $($BNF$)$ generates, and what $\text{'}$a$\text{'}$ should be to make it a real programming language example. Give a leftmost derivation to show that the sentence aa$+$a$*$ can be generated by this grammar, and draw the corresponding parse tree. $(2$ marks$)->+|*|$ a