Below is the empty AVL tree. The numbers are the indices of the elements, not the elements

themselves.

The tree with its initial contents tree should be interpreted as follows:

The sequence of the next elements to insert is: $2\mathrm{.}1$;$10\mathrm{.}3$;$13\mathrm{.}9$;$1\mathrm{.}4$

If the tree does not require any rotation, enter A$\mathrm{.}00,$ where $A$ is the index of insertion of the

last inserted element $1\mathrm{.}4.$

If the tree requires a single rotation, enter $-$ A$.$B$,$ where $A$ is the index of insertion of the last

inserted element $1\mathrm{.}4,$ and $B$ is the index of this element after rotation.

If the tree requires a double rotation, enter $A.B,$ where $A$ is the index of the last inserted

element $1\mathrm{.}4$ after the first rotation, and $B$ is the index of this element after the second

rotation.

Warning! B is a $2-$digit number, i$.$e$.,6$ must be entered as $06.$

Provide the index values without brackets.

Answer: