Suppose you have a deque D containing the numbers (2,3,4,5,6,7), in this order. Suppose further that you have an initially empty Queue Q.

Give a code fragment that uses only D and Q (and no other variables) and results in D storing the elements in the order (2,3,5,4,6,7). Note that 5 and 4 swapped places.

Also note that you solved this question before but you used a stack, this time you must use a queue.