PLEASE ANSWER AS SOON AS POSSIBLE IT S VERY IMPORTANT FOR ME :( PLEASE SOLVE CLEARLY. THANKS

Question 3 (25 points) (a) (15 pts) For the languages: Li = {a" bu+k; n,k 20} and L2 = {a^b*c"; n,k 20} prove whether each is a CFL or not by using either the pumping lemma or a CFG in Chomsky Normal Form that generates the language in question. (b) (10 pts) For the right linear CFG G=({A,B,S}, {0,1}, R, S) where R is given by : S+0A|1B; A =0B|IA|e ;B +18 |1 draw an NFA X that accepts the language Lg generated by G and then convert your X to a minimal state DFA Y