Problem
1. Write a new queue function called move_to_rear that moves the element currently at the front of the queue to the rear of the queue. The element that was second in line will be the new front element. Do this using functions push, front, and pop.
2. Answer without using functions push or pop for a single-linked list implementation of queue. You will need to manipulate the queue internal data fields directly.