This is in java.

Rewrite the heapsort algorithm so that it sorts only items that are in the range low to high. Low and high are passed as additional parameters. The other elements (outside the range low and high) should remain in their original locations. Note that low and high should be values or keys inside the heap, not heap indices. You are free to design the menu interface however you want but it must have a way to print all the elements and insert elements.