A queue is a data structure for maintaining a dynamic set S where the element deleted first from the queue is

the one that has been set for the longest time. That is$,$ a queue implements a FIFO policy $($first$-$in first$-$out$).$

The operations that a queue supports are:

$1.$ ENQUEUE$($S$,$x$)$ inserts the new element x at the tail of the queue.

$2.$ DEQUEUE$($S$)$ removes and returns the element at the head of the queue.

Show how to implement a FIFO queue with a priority queue. That is$,$ given a priority queue, Q$,$ show how

to implement the FIFO policy by implementing the ENQUEUE and DEQUEUE operations using the priority queue

operations.

NOTE: You must give pseudo$-$code implementations of the queue operations. Informal descriptions will

receive no credit.