JAVA PROGRAMMING

Suppose you have two stacks S and T as shown in the picture below and a queue Q. Use Q so that stack S stores all the elements of T and stack T stores all the elements of S, such that the stack S and T elements does not change its order. Hint: - Create 2 stacks S and T and insert the elements into the stacks as shown in the picture above - Remove the elements from the stacks and insert it into the queue Q - Remove the elements from the queue and insert it back to the stacks in the order as shown in the picture above. Note: The hint does not fulfils all the requirements