Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ such that
Option D suits more appropriate than other option.
It is a direct question , from peter linz
answer should be logkw <=h<= (|w|-1)/(k-1)
so D is correct answer here