"Java problems, am I doing right with this? Just checking.

Question $71$ After inserting the following number sequence, what type of rotation must the AVL tree perfor UN$12$ m to maintain balance? $5,1,3$ O rotateLeft O rotate RightLeft rotateLeftRight O rotate Right D Question $81$ A balanced tree is defined as a tree structure where the heights of each of its children differ by no more than one. True False D Question $91$ What is the worst case computational complexity when inserting n items into an initially empty AVL tree? O$($n$)$ On$^2)$ O$($n$*$log$($n$^2))$ O$($n$*$log$($n$))"$