Show the AVL trees resulting from performing the requested sequence of operations. Whenever a rotation is required, indicate the type of rotation used and what node it applies to. Whenever a double rotation is required, show the intermediate step (i.e., show the result after each of the single rotations). - On an initially empty tree, show each step of inserting the keys 9, 10 , 12, 14, 3, 34, 19,37,20. - On the tree shown below, show each step of deleting the keys p,d,h