Arsume dases LinkedQueue and ArrayStack have been defned using the inpdemertations in youar textbook that myQueue and myStack have been intialized so they are empty. Type the EXACT output oi the...

Please help

Extracted text: Arsume dases LinkedQueue and ArrayStack have been defned using the inpdemertations in youar textbook that myQueue and myStack have been intialized so they are empty. Type the EXACT output oi the iollawing code seement You may assume that the code comples and executes without errors. ArrayStack myStack; LinkedQueuerint myQueue, int i 13B Int -2; int k 3, int n 4; myStack.push 0 myQueue.enqueue myStack.push k) myQueue.enqueue k n-myStack.peek x myStack.pop n-myQueue.peekFront () myQueue.dequeue (k mystack.push k myQueue.enqueue ) myStack.push (n myQueue.enqueue nt myStack.push K myQueue.enqueue while tmystack.isEnmoty () i-myStack.peek(x mystack.pop (X cout < iec*":="" while="" (myqueue="" isempty="" 13="" 1-myqueue.peekfront="" )="" myqueue.dequeue="" (k="" cout=""><; cout="">< endl;="">