Suppose a circular queue of capacity \((n −1)\) elements is implemented with…

Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect $queue \ full$ and $\text queue \ empty$ are