In a circular queue using arrays, the rear is at index 4, front is at index 2, and capacity = 5. Which expression checks if the queue is full?

1. A(rear + 1 == front)
2. B(rear == front - 1)
3. C(rear == front)
4. D((rear + 1) % capacity == front)