If the size of the array used to implement 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 circular queue is MAX_SIZE.

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