#define SIZE $5$

#define NULL$\_$VALUE $0$

void next$($int $*$pointer$)$;

void enqueue$()$;

void dequeue$()$;

void print$\_$queue$()$;

int buffer$[$SIZE$]$;

int head;

int tail;

int main$($void$)$

$\{$

int menu;

while $(1)$

$\{$

printf$("$Select a number $(1.$ Enqueue $2.$ Dequeue $3.$ Queue Print $4.$ Exit$)$: $")$;

scanf$("\%$d$",$ &menu$)$;

if $($menu $==1)$

enqueue$()$;

else if $($menu $==2)$

dequeue$()$;

else if $($menu $==3)$

print$\_$queue$()$;

else if $($menu $==4)$

break;

$\}$

return $0$;

$\}$

void next$($int $*$pointer$)$

$\{$

if $(*$pointer $!=$ SIZE $-1)$

$*$pointer $=*$pointer $+1$;

else

$*$pointer $=$ NULL$\_$VALUE;

$\}$

void enqueue$()$

$\{$

int data;

printf$("$Enqueue a number: $")$;

scanf$("\%$d$",$ &data$)$;

if $($NULL$\_$VALUE $!=$ buffer$[$head$])$

$\{$

printf$("$Queue is full

$")$;

return;

$\}$

buffer$[$head$]=$ data;

next$($&head$)$;

$\}$

void dequeue$()$

$\{$

int data $=$ buffer$[$tail$]$;

if $($NULL$\_$VALUE $==$ data$)$

$\{$

printf$("$Queue is empty

$")$;

return;

$\}$

printf$("$Dequeued number: $\%$d

$",$ data$)$;

buffer$[$tail$]=$ NULL$\_$VALUE;

next$($&tail$)$;

$\}$

void print$\_$queue$()$

$\{$

int i;

printf$("$Queue is: $")$;

for $($i $=0$; i $<$ SIZE; i$++)$

printf$("\%$d $",$ buffer$[$i$])$;

printf$("\backslash$tHead: $\%$d$\backslash$tTail: $\%$d

$",$ head, tail$)$;

$\}$