2. (15 pts) This exercise is to learn binary search tree operations (a) Draw the sequence of binary search trees which results from inserting the following values in left-to-right order, assuming no balancing. 15, 10, 31, 25, 34, 56, 78, 12, 14, 13 (b) Starting from the tree at the end of the previous part, draw the sequence that results from deleting the following nodes in left-to-right order: 15, 31, 12, 14. (c) After deleting them draw the sequence of reinserting left-to-right in reverse order: 14, 12,31,15. in order into the tree and comment on the result