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

1. Develop a Java implementation of an adaptable priority queue that is based on an unsorted list…

1. Develop a Java implementation of an adaptable priority queue that is based on an unsorted list…

1. Develop a Java implementation of an adaptable priority queue that is based on an unsorted list and supports location-aware entries.2. Write an applet or stand-alone graphical program that animates a heap. Your program should support all the priority queue operations and should visualize the swaps in the up-heap and down-heap bubblings. (Extra: Visualize bottom-up heap construction as well.)