a) Draw the binary search tree whose elements are inserted in the following order: 40, 62, 86, 84, 107, 26, 12, 11, 91, 2, 10, 25, 41, 16, 15, 85 b) Using the tree in part (a), show separately for parts (i) and (ii) how the tree would look, along with the necessary code segments if: i) Node with value 2 was deleted ii) Node with value 62 was deleted