Suppose that q is a priority queue. It has the following operations.

IS-EMPTY(q)

Test if q is empty. Return either true or false.

IS-FULL(q)

Test if q is full. Return either true or false.

ENQUEUE(q, e, p)

If q is full, then assert an error. Otherwise add the element e to q with integer priority p.

DEQUEUE(q)

If q is empty, then assert an error. Otherwise remove the element from q with the highest priority. Return the removed element.

a. Explain how to implement a stack (last-in, first-out) using these operations. Your answer may be in English, in Cormens pseudocode notation, or in a programming language.