printf("\ the number deleted is % "val)breakcase val peek()if(val!=- printf("\ the first value in queue is % "val)breakcase display()break}while(option!= )getch()return void insert(int numprintf("\ enter the number to be inserted in the queue ")scanf("% "&num)if(front== &rear==max- printf("\ overflow")else if(front==- &rear==- front=rear= queue[rear]=numelse if(rear==max- &front!= rear= queue[rear]=numelse rear++queue[rear]=numint delete_element(int valif(front==- &rear==- printf("\ underflow")return - val queue[front]if(front==rearfront=rear=- else if(front==max- front= else front++return valint peek(if(front==- &rear==- printf("\ queue is empty")return -