Which of the following is FALSE about the Circular Array implementation of Queue?

Question $5$Answer

A$.$

Enqueue and Dequeue both take constant time to run.

B$.$

The number of elements in the queue is equal to the size of the array.

C$.$

The front element of the queue could be at any index of the array.

D$.$

The Enqueue operation may fail to add an element in some cases.

E$.$

The value of f can be either greater than or less than the value of r$.$

F$.$

The "circular" nature of the array is directly related to the modulo operator.