Test Series closed

Question

Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF?

 

My answer was ($2^{k+1}$)-1. But the answer given is  3* $2^k$ -1. Please someone explain