a) Bill suggested that he can implement a queue ADT using a priority queue and a constant amount of additional space. Recall that a stack supports enqueue and dequeue operations, and a priority queue supports min), removeMin and insert operations. Explain how Bill can achieve this by showing the necessary pseudo code for implementing the stack ADT