Consider the binary search tree that you constructed in the previous question. If we

interpret it now as an AVL tree, it has an imbalance that can be fixed with a rotation.

$($Remember that we focus on the deepest point of imbalance, where the magnitude of

the balance factor is $2$ or greater, to perform the rotation.$)$

After performing the correct balancing rotation about the node that we identified in the

previous question, the resulting tree is identical to which one of the following binary

search trees? $($We$\text{'}$ll describe these other trees by listing the order in which you would

insert items to create the trees directly.$)$

Inserting $32415$ one node at a time.

Inserting $42513$ one node at a time.

Inserting $21435$ one node at a times.

Inserting $35241$ one node at a time. FOO