4. (a) (4 points) Remove from the binary search tree in Figure 3.7(a) the following keys (in this order): 32, 65, 76, 88, 97. Draw the tree after each removal. (b)(2 points) A different binary search tree results when we try to insert the same sequence into an empty BST in a different order. Give an example of this with at least 5 elements and show the two different binary search trees that result. 17 65 97 L Figure 3.7a 54 29 76 80 78