data structures using if(front =- |front>rearprintf("\ underflow")return - else val queue[front]front++if(front rearfront rear - return valint peek(if(front==- |front>rearprintf("\ queue is empty")return - else return queue[front]void display(int iprintf("\ ")if(front =- |front rearprintf("\ queue is empty")else for( front; <rear; ++printf("\ % "queue[ ])output ****main menu ***** insert an element delete an element peek display the queue exit enter your option enter the number to be inserted in the queue note the process of inserting an element in the queue is called enqueueand the process of deleting an element from the queue is called dequeue linked representation of queues we have seen how queue is created using an array although this technique of creating queue is easyits drawback is that the array must be declared to have some fixed size if we allocate space for elements in the queue and it hardly uses - locationsthen half of the space will