data structures using int deleteb(int valif(frontb==maxprintf("\ underflow")return - else val queue[frontb]frontb--if (frontb<rearbfrontb=rearb=maxreturn valvoid display_queueb(int iif(frontb==maxprintf("\ queue is empty")else for( =frontb; >=rearb; --printf("\ % ",queue[ ])int main(int optionvalclrscr()do printf("\ *******menu******")printf("\ insert in queue ")printf("\ insert in queue ")printf("\ delete from queue ")printf("\ delete from queue ")printf("\ display queue ")printf("\ display queue ")printf("\ exit")printf("\ enter your option ")scanf("% ",&option)switch(optioncase printf("\ enter the value to be inserted in queue ")scanf("% ",&val)inserta(val)breakcase printf("\ enter the value to be inserted in queue ")scanf("% ",&val)insertb(val)breakcase val=deletea()if(val!=- printf("\ the value deleted from queue % ",val)breakcase val=deleteb()if(val!=-