The height h of a completely filled binary tree with n nodes is $\_\_\_\_.$

Group of answer choices

h$=$log$2($n$)1$

h$=$log$2($n$+1)$

h$=$log$2($n$)+1$

h$=$log$2($n$1)$