Question: 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 find Min. deleteMin. and insert.
b. Using these algorithms, what is the Big-Oh running time for each of f indMin, deleteMin, and insert?
c. Write an implementation that uses these algorithms and the STL priority queue interface, with a comparison function as a template parameter.