Please provide completed detail answer, don't copy someone's work, thank you

3. Construct a reduced grammar (i.e. a grammar without useless symbols) equivalent to the CFG G = ({S. A, B. C).(a,b,c). S, P), where P is the set of productions . Construct a grammarin Chomsky Normal Form that generates C(M) where M is the NFA M ({%-92.3, q(o.6),6,qn(%)) and is given by 92 5. Construct a Chomsky Normal Form grammar for (awwwE (a,b m21) 6. Consider the grammar G whose productions are (a) Use the CYK algorithm (not an algorithm of your own or an adhoc method) to show that bababa E C(G). (b) Use part (a) to construct a derivation tree for bababa 3. Construct a reduced grammar (i.e. a grammar without useless symbols) equivalent to the CFG G = ({S. A, B. C).(a,b,c). S, P), where P is the set of productions . Construct a grammarin Chomsky Normal Form that generates C(M) where M is the NFA M ({%-92.3, q(o.6),6,qn(%)) and is given by 92 5. Construct a Chomsky Normal Form grammar for (awwwE (a,b m21) 6. Consider the grammar G whose productions are (a) Use the CYK algorithm (not an algorithm of your own or an adhoc method) to show that bababa E C(G). (b) Use part (a) to construct a derivation tree for bababa