(a) Show the result of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2, one at a time and in the giver order, into an initially empty binary min heap.

(b) Show the result of performing three deleteMin operations in the heap of the previous binary min heap.

Important Notes:

For parts (a) and (b) of this problem, you must draw the min (or max) heaps using the appropriate graphics tools at your convenience.