Consider the following context-free grammar, where the alphabet is A = {a,+,*,(,)} and the start symbol is E.

E -> E + T | T

T -> T * F | F

F -> (E) | a

Give parse trees for each of the strings.

a) a * a

b) a + a * a

c) a * a + a

d) a * (a + a)

e) ((a))