Suppose you have a deque $D$ containing the numbers $(1,2...\mathrm{.}8)$ 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 $(8,7,..\mathrm{.}1)$

$[1]$ from collections import deque

def Question$3()$:

# Create a deque with the given numbers

$D=$ deque $(1,2,3,4,5,6,7,8]$

#TODO: implement this function

# Print the rearranged deque and the queue print$("$D:$",$ list$($D$))$

Question$3()$

$D$:$[1,2,3,4,5,6,7,8]$