1. (a) (4 points) Insert into an initially empty binary search tree items with the following keys (in this b) (4 points) Remove from the binary search tree in Figure 3.7(a) the following keys (in this order): (c) (2 points) A different binary search tree results when we try to insert the same sequence into an order): 30, 40, 23, 58, 48, 26, 11, 13. Draw the tree after all insertions. Include a few intermediate stages 32, 65, 76, 88, 97. Draw the tree after each removal. 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