Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1l,.... q[10]. The front and rear pointers are initialized to pointat q[2]. In whichposition will the ninth element be added?

A

q[0]

B

q[1]

C

q[9]

D

q[10]