A double-ended priority queue allows access to both the minimum and maximum elements. In other words, all of the following are supported: findMin, deleteMin, findMax, and deleteMax. Do the following:...

A double-ended priority queue allows access to both the minimum and maximum elements. In other words, all of the following are supported: findMin, deleteMin, findMax, and deleteMax. Do the following:

 a. Describe the algorithms for insert, findMin, deleteMin, findMax, and deleteMax.

 b. What is the Big-Oh running time for each of findMin, deleteMin, findMax, deleteMax, and insert using these algorithms?

 c. Write an implementation that uses these algorithms.