A FIFO queue is implemented using a priority queue. Each element is time-stamped as it is put into the queue. (The time stamp is a number between 0 and INT_MAX. Each time an element is enqueued, it is assigned the next larger number.) 1. What is the highest-priority element? 2. Write the Enqueue and Dequeue operations using the specifications in Chapter 4. 3. Compare these Enqueue and Dequeue operations to the ones implemented in Chapter 4, in terms of Big-O notation.