7. (15 points total) Binary Search Trees: (7 points) Starting with an empty Binary Search Tree, show the tree after inserting each of the following values sequentially: 7, 1, 4, 3,6, 5,2 a. (4 points) The result is not a valid AVL tree. Mark all nodes that individually violate the AVL balance condition. b. (4 points) Take the tree resulting from part a and perform a full remove operation on the value 4. Draw the resulting tree. c