PSEUDO CODE question. NOT Java or C, C++

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 queue ADT. b) Referring to a) above, what are the tight big-Oh time complexities of the push and pop operations of the newly designed stack given that the priority queue is implemented using a heap? Explain your answer.