Consider the following operations on an initially empty heap h; this heap is a maxheap, so the biggest item is at the top. The heap is represented as a binary tree: h. insert(5); h. insert(6); h. insert(0); h. insert(3); h. insert(10); h. insert(1); int item; h. remove(item); // Removes the biggest item from the heap, and puts it in item h. insert(9); h. insert(7); h. remove(item); a. Show the resulting heap (As in problem la, show the tree in some recognizable form.)
b. Show how your heap from part a would be represented in an array.
c. After executing h. remove(item); one more time, show the array that results.