#include using namespace std; int queue[100], n , front = - 1, rear = - 1; void Insert() { int val; cout<<"Enter The Number of Elements: "; cin>>n; if (rear == n - 1) cout<<"Queue Overflow"<>val; rear++; queue[rear] = val; } } void Delete() { if (front == - 1 || front > rear) { cout<<"Queue Underflow "; return ; } else { cout<<"Element deleted from queue is : "<< queue[front] <>ch; switch (ch) { case 1: Insert(); break; case 2: Delete(); break; case 3: Display(); break; case 4: cout<<"Exit"<