If a non$-$empty binary tree has n nodes, what is the possible maximal height of the binary tree? What is the possible minimal height of the binary tree?

Group of answer choices

N$-1,$ floor$($log$2$N$)$

N$,$ ceil $($log$2$N$)$

N$,$ floor$($log$2($N$+1))$

N$-1,$ ceil$($log$2($N$+1))$