fast answer please

Question 13 Suppose a circular queue of capacity (n-1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT-O. The conditions to detect queue full and queue empty are Your answer: Full:(REAR+1) mod n --FRONT, empty: REAR -- FRONT O Full: (REAR+1) mod n - FRONT, empty: (FRONT+1) mod n == REAR O Full: REAR FRONT, empty: (REAR+1) mod FRONT O Full: (FRONT+1) mod n = REAR, emptyREAR == FRONT None of the above