If $G$ is a CFG and $w$ is a string of length $n>0$ in $L(G),$ how long is a derivation of $w$ in $G,$ if $G$ is

in Chomsky normal form?

$2n+1$

None of the above

$2n$

$2n-1$

n