Find two use cases (Applications) of the priority queue and explain how the use cases (Applications) apply the priority queue using Heap. Your explanation should include the following: Operations (Create, Add, Remove, Full, Empty) on Priority Queues

How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should all operate in O(1) time. Your design (in pseudo code) should include a class Stack and three functions, i.e., push, pop, and min.

a. What is the key value of the left child of 88?  b.What is the key value of the right child of 88?  c. Start with the original max-Heap. What is the key of the left child of the root (element 0 of the vector) after a pop() operation?

Write a function that converts a given min heap which is implemented by arravs to a max heap. The prototype of the function is queue "convert(queue "q).in c language