A stack is implemented using a priority queue. Each element is time-stamped as it is put into the stack. (The time stamp is a number between zero and I nt e - ge r . MAX_VALUE. Each time an element is pushed onto the stack, it is assigned the next largest number.)
a. What is the highest-priority element?
b. Describe how the pus h, t op, and pop operations could be implemented.