Let G be a CFG in the Chomsky Normal Form. Prove the following.
(a) If w is a string of L(G) of length n≥1, then every derivation of w has length 2n-1.
(b) Suppose that G has m variables. If G generates a string via a derivation of length ≥2m, then L(G) is infinite.