Suppose you have two nonempty stacks S and T and a deque D. Describe how to use D so that S contains all the elements of T below all of its original elements, with both sets of elements still in their original order.

I need the code in C++