A red$-$black tree with n internal nodes has height at most

Group of answer choices

$2($ n$+1)$

$2($lg n $+1)$

$2($lg n $)$

$2($lg n$-1)$