If the size of the array used to implement a circular queue is MAX_SIZE. How rear moves to traverse inorder to insert an element in the queue?

If the size of the array used to implement a circular queue is MAX_SIZ

1.	If the size of the array used to implement a circular queue is MAX_SIZE. How rear moves to traverse inorder to insert an element in the queue?
A.	rear=rear%(MAX_SIZE+1)
B.	rear=rear+(1%MAX_SIZE)
C.	rear=(rear+1)%MAX_SIZE
D.	rear=(rear%1)+MAX_SIZE
E.	None of these
Answer» D. rear=(rear%1)+MAX_SIZE