Partition all number between

$0$

$0$ and

$100$

$100$ that are not yet in the above AVL$-$tree into intervals such that two numbers in the same interval would be added to the same position in the AVL$-$tree.

For each such interval you need to specify:

$(1)$ The interval, e$.$g$.,0-6.$

$(2)$ The position in the AVL$-$tree, where every number in the interval is inserted. For instance, if all numbers in the interval are inserted to the left of $7,$ write L$7,$ if they are inserted to the right of $7,$ write R$7.$

$(3)$ The type of reorganization that has to be applied after one $($any$)$ number in the interval would be inserted in the AVL$-$tree. There are three possible types of reorganization:

$($A$)$ For no reorganization write N$.$

$($B$)$ For a simple rotation write SR$.$

$($C$)$ For a double rotation write DR$.$

You should consider the intervals in their natural order. Use each of the following sub$-$questions to specify all of the above information for one interval $($starting from the second interval because the first interval is given as an example$).$ For instance, the first interval contains all numbers between $0$ and $6,$ and those will be inserted to the left of $7$ using a simple rotation. Therefore, you would need to write: $0-6$ L$7$ SR for the first interval.

Question $5\mathrm{.}12$nd interval: