Consider a Deque data type with the usual methods add_front, add_rear (to insert items from the input) or remove_front, remove_rear (to remove items to the output) from either end of a Deque instance.

In addition, we also have the operations rotate_to_rear that moves the item at the front of the Deque instance to the rear of that instance.

Consider a Deque instance that already contains the numbers 0, 1, 2, 3, 4 in left-to-right order from front to rear (so 0 is at the front of the deque and 4 is at the rear).

Provide an exact sequence of Deque operations that will output the numbers in the order 3,2,0,4,1 and indicate clearly what the Deque instance looks like at each intermediate stage during this process. The Deque instance should be empty at the end.