Problem 2 [15 points] Show that if G is a CFG in Chomsky normal form (CNF), then 1, exactly 2n 1 steps are required for any for any string w e L(G) of length n derivation of w For example, consider the following CFG a Deriving the string w = aabb takes 7 steps. Here's one derivation This is just an example to illustrate what you have to prove. Your proof should be about an arbitrary CFG G = (V, ,R,S) in CNF, not about this particular example