Using the algorithm from class, convert the following CFG to Chomsky Normal Form. Do not simplify the resulting CFG. S rightarrow QR Q rightarrow AQBB | R rightarrow cR| A rightarrow a B rightarrow b A definition of Chomsky Normal Form as well as examples of the algorithm can be found in the optional text book starting with Definition 2.8. Give a formal description of the language generated by the grammar