For any problem that requests that you perform an AVL operation on an AVL tree, do NOT just give a new AVL tree that happens to contain (only) the requested nodes. Give the AVL tree that the insertion or deletion algorithms we discussed would generate. 1. Consider the following AVL Tree: 50 30 80 10 60 90 55 70 85 (100) i) Show that this tree is a valid AVL tree. That is, show that each node in the tree is not in violation of the AVL tree properties. ii) Redraw the AVL tree (paying careful attention to the note at the beginning of this assignment) as it would appear after the insertion of the value 95