Suppose I want to implement the public member functions of a Stack (push, pop, top, size, isEmpty). However, instead of the private member data we had in class, I have only a single Queue.

You may assume that the Queue has unbounded capacity, but is otherwise as per the one shown in class. Explain at a high level (you do not need to provide C++ code, but someone should be able to understand how you would code it from what you wrote) how you would implement each of those functions using just that Queue. Note that you must use the Queues public interface (enqueue, dequeue, etc) and cannot access the underlying private member data. For each function, give the running time in O notation in terms of n, the number of elements currently in the stack.