Help i suck

3. (a) Show that the following CFG Gi-(S,A), (begin, end,;, a, P, S) is ambiguous. (b) For each derivation tree in (a), give both the leftmost and rightmost derivations. G: S begin A end 4. (a) Convert the following CFG G2-(S,A,B,C, fa, b), P, S) into its proper form, i.e. first delete -productions, next delete single productions, then delete non-productive symbols, and last delete inaccessible symbols. Show intermediate results at the end of each step. (b) Get the equivalent Chomsky Normal Form (CNF) for the resulting grammar in (a)