Problem 3. (a) Insert into an initially empty binary search tree items with the following keys (in this order): 37, 47, 30, 65, 55, 33, 18, 20. Draw the tree after each insertion. (b) Remove from the binary search tree in figure 3.7(b) the following keys (in this order): 32, 65, 76, 88, 97. Draw the tree after each removal