Problem
1. Answer Question 2 without using functions push or pop for a circular array implementation of queue. You will need to manipulate the queue internal data fields directly.
2. Write a new queue function called move_to_front that moves the element at the rear of the queue to the front of the queue, while the other queue elements maintain their relative positions behind the old front element. Do this using functions push, front, and pop.
Question 2
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.