$(75$ pts$)$ MaxHeap to MinHeap:

Using the MaxHeap class provided in $27\mathrm{.}4,($based on the ADT Heap specified in $27\mathrm{.}1,)$ plus the add$()$ method specified in $27\mathrm{.}8$ as a starting point, show what changes must be made to convert the code into a MinHeap class. Submit any analysis of pseudocode in a Word $.$docx or Java code in a $.$Java file $($but not both!$).$ Include comments indicating the changes! Your code, if submitted, does not have to run. Only indicate what should be changed to get a MinHeap, and only include the code affected by your conversion! You do not have to submit the entire MaxHeap$/$MinHeap class.

$(25$ pts$)$ After removing the max entry in a maxHeap, what remains is a semiheap $(27\mathrm{.}10).$ Describe a semiheap in detail. Is a semiheap also a heap, or does it contain a heap? Explain!