Heap basics. Suppose we insert the following numbers into a min heap (which is initially empty), in the given order: 9, 15, 4, 3, 6, 13, 2, 11, 7, 1, 16, 12, 14,8,10,5. Recall that a min heap is a heap where the root contains the smallest item (as opposed to a max heap, where the root contains the largest item). (a) Draw a picture of the heap after each insertion. Draw the heap as a tree (ignoring the fact that this tree is usually implemented as an array). (b) Now suppose that three DeleteMin operations are performed. Draw a picture of the heap after each of these three operations