A normal queue, if implemented using an array of size MAX_SIZE, gets full when?Rear = MAX_SIZE – 1Front = (rear + 1)mod MAX_SIZEFront = rear + 1Rear = front

A normal queue implemented using an array of size MAX_SIZE gets full when the Rear = MAX_SIZE – 1. This is because the rear of the queue is where elements are added (enqueued), and it starts from 0 (the first index of the array). So, when Rear = MAX_SIZE - 1, it means that the rear has reached the end of the array, and no more elements can be added, hence the queue is full.

The other conditions mentioned are not typically used to determine if the queue is full:

• Front = (rear + 1) mod MAX_SIZE: This condition is often used in a circular queue to determine if the queue is full. In a circular queue, the end of the queue wraps around to the start of the array, so this condition checks if the front of the queue has wrapped around to the rear.

• Front = rear + 1: This condition could be used to check if the queue is empty in a circular queue implementation, not if it's full. In an empty queue, the front and rear are at the same position.

• Rear = front: This condition is typically used to check if a queue is empty, not if it's full. If the front and rear are at the same position, it means no elements are in the queue.