Consider an empty AVL Tree built by inserting n distinct integer keys$/$values$.$ What is the minimum height of an AVL tree with n nodes$/$integer$?$

Points will be deducted for each incorrect response; however, negative scoring will not be applied.

Question $3$Select one or more:

floor $($ log$2($n$))+1$

Ceil$($ log$2($n$))-1$

None of the listed answers is correct.

floor $($ log$2($n$))$

floor $($ log$2($n$))-1$

floor $($ n$/2)$

Ceil$($ log$2($n$))+1$

Ceil$($ log$2($n$))$