title: How can I prove that derivations in Chomsky Normal Form require 2n - 1 steps?
body: <p>I'm trying to prove the following:</p>
  
  <blockquote>
    <p>If G is a Context Free Grammar in the Chomsky Normal Form, then for any string w belongs L(G) of length n &ge; 1, it requires exactly 2n-1 steps to make any derivation of w.</p>
  </blockquote>
  
  <p>How would I go about proving this?</p>