Show the AVL tree that results after each of the integer keys 22, 43, 4, 1,2,3,5, and 6 are inserted, in that order, into an initially empty AVL tree. Clearly show the tree that results after each insertion, and make clear any rotations that must be performe points) d. (10