Consider a standard Circular Queue'q' implementation $($which has the same condition for Queue Full and Queue Empty$)$ whose size is $11$ and the elements of the queue are q$[$Ol$,$ q$[1],$ q$/21.....,$q$|101.$ The front and rear pointers are initialized to point at q$/2].$ In which position will the ninth element be added?Question $11$ Answera.q$[1]$q$[9]$C$.$d$.$ q$[10]$