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 functions increment REAR and FRONT respectively. State the conditional statement which would, upon evaluating to True, identify the queue as full.