Consider the given insert function for a queue. Which of the following can be replaced with if$($isQueueFull$($c$))$ so that the functionality stays the

same?

void insert$($struct Queue $*c,$ int $x)$

$\{$

$if(c$ rear $==QUEU{E}_S$IZE$-1)$

$,c$ rear $=0$;

else

$(c$ rear$)++$;

if$($isQueueFull$($c$))$

cout$$"Overflow: Queue is full" $$