In decision tree learning, what is the maximal tree height if there are n features?

Question $1$ options:

$1)$

lg$($n$)$

$2)$

n

$3)$

n$*$lg$($n$)$

$4)$

n$/2$