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 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.