A FIFO queue is implemented using a priority queue. Each element is timestamped as it is put into the queue. (The time stamp is a number between zero and I nt e ge r . MAX_VALUE. Each time an element is enqueued, it is assigned the next largest number.)
a. What is the highest-priority element?
b. Describe how the e nque ue and de que ue operations could be implemented.