IE void main() { 3: Queue q; X = 10; 5: Y = 15; 6: q. enqueue (x); 7: q. enqueue (y); 8: if (x % 5 = 0) q. enqueue (y-x); 10: if (q.getFront () >= 10) 11: item = q.dequeue(); 12: q. enqueue (x+y); 13: item = q.dequeue (); 14: if (q.isFull()) 15: item = c.deQueue (); 16: q. enqueue (25 - 5); 17: cout = 10) item = q.dequeue (); [2] [1] [0] front- rear = item= iii) q.enqueue (x+y); item = q. dequeue(); [2] [1] [0] front- rear- item- iv) if (g.isFull()) item = q.deQueue (); [3] [2] [1] [0] front rear item isFull() q. enqueue (25 - 5); cout