Suppose you have three nonempty stacks R, S, and T. Describe a sequence of operations (i.e. write the pseudocode) that results in S storing all elements originally in T below all of Ss original elements, with both sets of those elements in their original order. The final configuration for R should be the same as its original configuration. For example, if R = (1,2,3), S = (4,5), and T = (6,7,8,9), when ordered from bottom to top, then the final configuration should have R = (1,2,3) and S = (6,7,8,9,4,5).

You must use the methods: push(), pop(), peek(), size(), isempty(). You may not instantiate a new temporary stack; you can only use existing stacks R, S, and T. Other helper variables are allowed.