4. Consider the following grammar G: S > ABC I CD A-> BAB I Bl B ->alb C -> ABC I ACIBC D-> EDE I aa l E -> bb A. Remove epsilon-rules, unit-productions, and useless productions from G to make a new equivalent grammar G' (if epsilon is in L(G), the one exception that is not in the L(G')). B. Convert the grammar to Chomsky Normal Form. C. What language does this grammar generate (justify your answer)