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

2. Consider the CFG G whose productions are as below ACDI a (a) EliminateA-productions from G and write down the resulting grammar (b) Eliminate the unit productions from the grammar you have obtained in part (a) and write down the resulting grammar (c) Eliminate useless sybos from the gramar you have obtained in part (b) and write down the resulting grammar 3. Constrt a reduced grammar (i.e. a g without useless sybols) equivalent to the CFG G (IS, A, B,C, a, b,e,S, P), where P is ths of productions 4. Construct a gramma CskyNa Form that generates L(M) where M is the NFA M = ({91,92, q3,9a}, {a, b), ,Y1, {ga) and is given by 5. Construct a Chomsky Normal Form grammar for fa"wVwE a, b, m2 1) 6. Consider the grammar G whose productions are (a) Use the CYK algrith no algorit of your own or an adhoc method) to show that bababa E LG) (b) Use part (a) to construct a derivation tree for bababa