1. Start with an empty binary search tree. a. Insert the keys 4,12,8,16,6,21,24,1,14,3 in this order. Draw the tree after each insertion. (You should have 10 drawings of trees.) b. From the tree that results from part (a), remove the keys 6,14,16, and 4 in this order. Draw the tree after each deletion. c. What is the height of the tree after part b.? d. Which nodes are the leaves of the tree after part b