A circular queue implementation uses an array of length SIZE to hold queue items as well as two variables called REAR and FRONT to hold the current index positions of the rear (tail) and front (head) of the queue respectively. Enqueue and dequeue increment REAR and FRONT respectively. Select the conditional statement below which would, upon evaluating to True, identify that the queue only has one element remaining.