Suppose you have two stacks S and T as shown in the picture below and a queue D. Use D so that stack S stores all the elements of T below its original elements, the 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 D - 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