$3$ Proof

Sketch a proof to show that if $G$ is a context$-$free grammar in Chomsky normal form, then for any

string winL$(G)$ of of length $n1,$ exactly $2n-1$ steps are required for any derivation of $w.$