Question: By maintaining the invariant that the elements in the priority queue are sorted in nonincreasing order (that is, the largest item is first, the smallest is last), you can implement both findMin and deleteMin in constant time. However, insert is expensive. Do the following:
a. Describe the algorithms for insert, findMin, and deleteMin.
b. What is the Big-Oh running time for insert?
c. Write an implementation that uses these algorithms.