Construct a parse tree top$-$down for the input string w $=$ cae using

the following grammar:

S $->$ c E e

E $->$ a b $|$ a

Show all the steps that led to get the final parse tree