+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Reimplement the SortedPriorityQueue using a Java array. Make sure to maintain removeMin’s O(1)…

1. Reimplement the SortedPriorityQueue using a Java array. Make sure to maintain removeMin’s O(1)…

1. Reimplement the SortedPriorityQueue using a Java array. Make sure to maintain removeMin’s O(1) performance.2. Give an alternative implementation of the HeapPriorityQueue’s upheap method that uses recursion (and no loop).3. Give an implementation of the HeapPriorityQueue’s downheap method that uses recursion (and no loop).