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. 2. Consider the following AVL tree (same as problem 1, without the new insertion): 50 30 80 10 60 90 55 70 85 (100) Redraw the AVL tree (again, paying careful attention to the note at the beginning of this assignment) as it would appear after the insertion of the value 52