A circular queue of capacity 5 is implemented using a 0-indexed array of size 5. The queue uses two pointers:

• $front$: the index of the element currently at the front of the queue.
• $rear$: the index of the last element added to the queue.

Initially, the queue is empty, with $front=0$ and $rear=4$.

The operations to enqueue and dequeue are defined as follows:

• Enqueue($x$): $rear=(rear+1)(\mathrm{mod}5)$, then $array[rear]=x$.
• Dequeue(): $x=array[front]$, then $front=(front+1)(\mathrm{mod}5)$, and return $x$.

The following sequence of operations is performed on the empty queue:

1. Enqueue('A')
2. Enqueue('B')
3. Enqueue('C')
4. Dequeue()
5. Enqueue('D')
6. Dequeue()
7. Enqueue('E')
8. Enqueue('F')

Which of the following correctly identifies the final values of $front$ and $rear$, and the sequence of active elements in the queue (from front to rear)?