a) Insert the following keys into a binary search tree 56, 37, 86, 24, 32. i. Show the resulting tree and indicate the balancing factor in each node of this tree Now, suppose this is an AVL tree. After the last insertion, apply the rebalancing algorithm in order to balance this tree, and show the resulting tree b) Remove key 45 from the following AVL tree and show the resulting tree (note that dummy leaves have been ommitted from the drawing but you should consider in your simulations) Display the tree after each rebalancing operation. 15 50 10 30 45 60 20 35 25