Which of the following statements are CORRECT

The best$-$case running time for inserting a new value into an AVL tree is O$(1).$

The maximum number of rotations for inserting a single value into an AVL tree is one.

The worst$-$case time for deleting a node$/$value from an AVL tree is O$($n$).$

where n is the number of nodes in the tree.

Question $5$Select one:

I, II and III.

I only.

I and II$.$

II only.

II and III.

III only.

none of them is correct

I and III.