1. Use the algorithm given in class and in our textbook that takes a CFG and converts it into a CNF grammar that accepts the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. Give a CFG in CNF that accepts the same language, except possibly for the string A, as the following grammar S AB 2. Use the pumping lemma for context free languages to show that the language L= { albicak l i, k 0} is not context free