5. Show how to implement the stack ADT using only a priority queue and one additional integer instance variable (10 points). (Hint: Use methods of insert(k,v) and removeMin() of priority queue, and figure out a way to time stamp the entries in the priority queue.)