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

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

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

C. Enqueue and Dequeue both take constant time to run.

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

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

F. The "circular" nature of the array is directly related to the modulo operator. Which of the following is FALSE about Stack, Queue, Deque, Priority Queue?

A. A priority queue can be used to behave like a queue, i.e., you can implemented a queue using a priority queue.

B. A queue can be used to behave like a stack, i.e., you can implemented a queue using a stack.

C. A deque can be used to behave like a queue, i.e., you can implemented a queue using a deque.

D. Two stacks combined can be used to behave like a queue, i.e., you can implemented a queue using two stacks.