Just three hand-drawn tree figures

Problem 1 (AVL deletion example). Draw an example situation where a single deletion in an AVL tree requires two trinode restructuring operations. The trinode operations may involve one or two rotations each, that is up to you (you don't need to draw the individual rotation steps). Draw three figures: a. Draw your initial AVL tree, where one node (without children) has just been detached for deletion. Indicate the node that has been detached. Also indicate (using x,y,z as in the slides) the three nodes that will be involved in the first trinode restructuring operation. b. Draw the tree after the first trinode operation. In this tree, indicate (using x,y,z again) the three nodes that will be involved in the second trinode restructuring operation. c. Draw the final tree, after the second trinode operation. It should be AVL again