consider the following statements. stacktype stack; queuetype queue; int x, y;suppose that the input is 15 28 14 22 64 35 -19 32 7 11 13 30 -999

Consider the following statements: stackType stack; queueType queue; int x;y Suppose the input is 15 28 14 22 64 35 19 32 7 11 13 30 -999 Show what is written by the following segment of code: stack.push(0); queue.addQueue(0); cin >> x; while (x!= -999) { switch (x % 3) { case 0: stack.push(x); break; case 1: if (!stack.isEmptyStack()) { cout << "Stack Element = " << stack.top() << endl; stack.pop(); } else cout << "Sorry, the stack is empty." << endl; break; case 2: queue.addQueue(x); break; case 3: if (!queue.isEmptyQueue()) { cout << "Queue Element = " << queue.front() << endl; queue.deleteQueue(); } else cout << "Sorry, the queue is empty." << endl; break; } //end switch cin >> x; } cout << "Stack Element: "; while (!stack.isEmptyStack()) { cout << stack.top() << " "; stack.pop(); } cout << endl; cout << "Queue Elements: "; while (!queue.isEmptyQueue()) { cout << queue.front() << " " ; queue.deleteQueue(); } cout << endl;