Java program

$1.$ For a given Heap class, implement Heap Sort and test heap sort by using $2$ different test cases

$2.$ For a given Heap class, Implement Priority Queue and test priority queue. $($use adaptor designpattern$)$

$3.$ Observe the sorting result of question $1.$ If the sorting results are from smallest to largest, modify the heap class and$/$or heap sort class, so that the sorting results are from largest to smallest. Vice versa.