Assume the class ArrayStack and the class ArrayQueue have been implemented using the implementations in zybooks, module presentations and in sample code. Assume also that the code compiles and executes without errors. Given the following code fragment:

ArrayStack myStack;

ArrayQueue myQueue;

int i $=4$;

int j $=3$;

int k $=2$;

int n $=1$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

myStack.push $($k$)$;

myQueue.enqueue $($k$)$;

myStack.push $($i$)$;

myQueue.enqueue $($i$)$;

j $=$ myStack.peek $()$;

myStack.pop $()$;

j $=$ myQueue.peekFront $()$;

myQueue.dequeue $()$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

n $=$ myQueue.peekFront $()$;

myQueue.dequeue $()$;

n $=$ myStack.peek $()$;

myStack.pop $()$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

j$++$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

n$++$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

$//$Type the exact output produced by the following code fragment in the box below it$.$

while $(!$myStack.isEmpty$())$

$\{$

i $=$ myStack.peek $()$;

myStack.pop $()$;

cout $<<$ i $<<""$;

$\}$

cout $<<$ endl;Assume the class ArrayStack and the class ArrayQueue have been implemented using the implementations in zybooks, module presentations and in sample code. Assume also that the code compiles and executes without errors. Given the following code fragment:

ArrayStack myStack;

ArrayQueue myQueue;

int i $=4$;

int j $=3$;

int k $=2$;

int n $=1$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

myStack.push $($k$)$;

myQueue.enqueue $($k$)$;

myStack.push $($i$)$;

myQueue.enqueue $($i$)$;

j $=$ myStack.peek $()$;

myStack.pop $()$;

j $=$ myQueue.peekFront $()$;

myQueue.dequeue $()$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

n $=$ myQueue.peekFront $()$;

myQueue.dequeue $()$;

n $=$ myStack.peek $()$;

myStack.pop $()$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

j$++$;

myStack.push $($j$)$;

myQueue.enqueue $($j$)$;

n$++$;

myStack.push $($n$)$;

myQueue.enqueue $($n$)$;

$//$Type the exact output produced by the following code fragment in the box below it$.$

while $(!$myStack.isEmpty$())$

$\{$

i $=$ myStack.peek $()$;

myStack.pop $()$;

cout $<<$ i $<<""$;

$\}$

cout $<<$ endl;