PSEUDO CODE question. NOT Java or C, C++ It DOES NOT involve stack, only QUEUES

a) Bill suggested that he can implement a queue ADT using a priority queue and a constant amount of additional space. Recall that a queue 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 enqueue and dequeue operations of the newly designed queue given that the priority queue is implemented using a heap? Explain your answer