Q. 2 Maximum score 40 (15 points for part (a) and 25 points for part (b) Consider the following grammar {N = (S,T,U,V,W), T = {a,b,c}, Starting state S, and production rules STUV T-aTb|a U-Ula VaVc/W W-Wla (a) What is the language generated by this grammar? (b) Convert the grammar to Chomsky Normal form (CNF){ Hint: You can remove all the 2-production rules in one-step and same way you can remove all unit production rules in one step}