Consider inserting the following integers 10, 5, 1, A, 3, 2, in an empty AVL tree. Replace letter A by an integer without duplication other integers in the list before starting to insert. What interer did you pick for A? As you enter nodes in the AVL tree indicate which node becomes unbalanced and what kind of rotation is applied to which nodes to make the tree balanced. No graphs, must clearly indicate the type of rotation and nodes involved.