Consider a standard circular queue ‘q’ implementation (which has same…

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[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. Rear denotes the last occupied position and advances before each new element is stored. In which position will the ninth element be added?