Please Explain your process $(10$pts$)$ Let $G$ be the grammar

$S\frac{}{a}bSc|A$

$A$cAd$|cd$

a$)$ Give a left$-$most derivation of ababceddcc.

b$)$ Build the derivation tree for the derivation in part $($a$).$

c$)$ Use set notation to define $L(G).$

$(50$pts$)$ For each of the following context$-$free grammars, use set notation to define the

language generated by the grammar.

a$)$

$S$aaSB$|$

$BbB|b$

b$)$

$S$aSbb$|A$

$AcA|c$

c$)$

$S\frac{}{a}bSdc|A$

$A$cdAba$|$

d$)$

$S$aSb$|A$

$A$cAd$|cBd$

$B$aBb$|ab$

e$)S$aSB$|aB$

$Bbb|b$