The following values are to be inserted in an initially-empty binary search tree one- by-one in the given order: 12, 26, 49, 15, 30, 9, 57, 62, 41, 75, 66, 63 a) Show the final tree that results if these values are inserted into an ordinary binary search tree. What is the height of the tree? b) If an AVL tree is used instead of an ordinary binary search tree, show the sequence of trees that result from insertion of these values. For each insertion that causes the tree to become unbalanced, show the tree after insertion but before rebalancing and then show the tree that results after the rebalancing operation. Show the final tree after all insertions and rebalancing operations are done and write the balance next to each node in the final tree. What is the height of the final tree