Suppose G is a grammar in CNF, let w L(G), and let T be a derivation tree for w. Prove that if the longest path in T is of length n, then |w| 2^(n1).

7. (5 pts) Suppose G is a grammar in CNF, let w E L(G), and let T be a derivation tree for w. Prove that if the longest path in T is of length n, then Itel 2n-1