In a queue implemented with a circular array of size $N,$ where head and tail are associated with the indices of the next element to dequeue and the most recently enqueued element,

respectively, which of the following expressions evaluates to True if and only if the queue is full?

$($head $+1)\%N==$ tail

tail $\%N==$ head $-1$

$($head $+$N $)\%N==$ head

$($tail $+1)\%N==$ head

Your answer is correct