Let G be a grammar in Chomsky Normal Form with n variables. Suppose that there is a derivation (using the rules of G) of a string in the language of G such that the derivation has at least 2" steps. Prove that the language generated by G is infinite (Hint. Observe that any parse tree generated by a grammar in CNF is a binary tree). Let G be a grammar in Chomsky Normal Form with n variables. Suppose that there is a derivation (using the rules of G) of a string in the language of G such that the derivation has at least 2" steps. Prove that the language generated by G is infinite (Hint. Observe that any parse tree generated by a grammar in CNF is a binary tree)