Question: By adding an extra data member to the priority queue class in Exercise, you can implement both insert and findMin in constant time. The extra data member maintains the array position where the minimum is stored. However, deleteMin is still expensive. Do the following:
a. Describe the algorithms for insert, findMin, and deleteMin.
b. What is the Big-Oh running time for deleteMin?
c. Write an implementation that uses these algorithms.
Exercise: A priority queue can be implemented by storing items in an unsorted array and inserting items in the next available location. Do the following:
a. Describe the algorithms for findMin, deleteMin, and insert.
b. What is the Big-Oh running time for each of findMin, deleteMin, and insert using these algorithms?
c. Write an implementation that uses these algorithms.