#include using namespace std; int queue[10]; int front=0; int rear=0; void Enque(int x) { if(rear==10) { cout<<"\nOverflow"; } else { queue[rear++]=x; } } void Deque() { if (front==rear) { cout<<"\nUnderflow"; } else { cout<<"\n"<>ch; if (ch==1) { cout<<"\nInsert : "; cin>>x; Enque(x); } else if (ch==2) { Deque(); } else if (ch==3) { show(); } } while(ch!=0); return 0; }