The following grammar enlists $3$ rules:

X $->$ eXgZ $|$ Y $|$ f

Y $->$ gY $|$ g

Z $->$ h $|$ Y

Which of the following sentences are in the language generated by this grammar? For those

that are, use a parse tree to show a derivation.

a$.$ efgh

b$.$ egggfh

c$.$ eggfgg

d$.$ egh

e$.$ eggg