Given a queue populated with an unknown number of elements, along with an empty stack object, develop an algorithm in Java-like pseudocode that removes all of the items from the queue and puts them back in the queue in reverse of their original order.

The only stack and queue operations available to you are the ones specified in StackInterface.java and QueueInterface.java, the interfaces provided for Programming Project #2, that we also used for class exercises.

Please use myQ as the name of the queue, and myStack for the name of the stack.