1. Suppose we use an array to implement a MinHeap. We first insert the following numbers into the heap: 20, 31, 15, 21, 25, 12, 35, 14, 19, 30. We then call removeMin five times.

• (20pt) Show the content of the array after each insert.
• (10pt) Show the content of the array after each removeMin.

For this exercise, put the answers in a text file lab7.txt or an MS Word file lab7.doc.

• (3pt) Comparable min() - returns the smallest element in the heap
• (30pt) Comparable removeMin() - removes and returns the smallest element in the heap
• (2pt) void clear() - remove all elements from the heap

(5pt) Write some test code to verify your answers for Excercise 1.

3. Turn in all the source code files and lab7.txt (or lab7.doc) through CSNS.