Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0], q[1], \ldots q[10]$.
The front and rear pointers are initialized to point at $q[2]$. In which position will the ninth element be added?
- $q[0]$
- $q[1]$
- $q[9]$
- $q[10]$