I. (a) Show that the following CFG G,-((SA}, {begin, end. ;, a), P, S) ?s ambiguous (b) For the first derivation tree in (a), give both the leftmost and rightmost derivations. G: S-begin A end 2. (a) Convert the following CFG G,-((S,A,B,C), {a, b), P, S) ?nto its proper form, i.e. first delete &-productions, next delete single productions, then delete non-productive symbols, and last delete inaccessible symbols. Show results at the end of each step. (b) Get the equivalent Chomsky Normal Form (CNF) for the resulting grammar in (a)