4. Assume you are given a Queue and Stack data structure as described in class that have the following methods: Stack/Queue (default constructors), enqueue/push, . dequeue/pop, peek, isEmpty. Your task is to write a method with the following signature: public static void reverseStack (Stack inStack) This method, when given a stack alters its contents so they are in the reverse order (i.e. the bottom becomes the top), using only Stacks and Queues (i.e. no arrays). Notice that you are not given any information about the internal structure of the Stack and Queue implementation or any access to it's internal variables. Example: if the input stack was: -1 15 7 3 4 after running your method it would be: 4 3 7 15 T