What is the output of the following code? Recall that stacks and queues print in an [a, b, c] format from bottom/front to top/back.

Stack s = new Stack();

Queue q = new LinkedList();

s.push("how");

s.push("are");

s.push("you");

while (!s.isEmpty()) {

 q.add(s.pop());

}

System.out.println(q);

2) Write the output produced when the following method is passed each of the following stacks:

public static void mystery1(Stack s) {

 Queue q = new LinkedList();

 while (!s.isEmpty()) {

 int n = s.pop();

 q.add(n);

 q.add(n);

 }

 while (!q.isEmpty()) {

 s.push(q.remove());

 }

 System.out.println(s);

}

[2, 6, 1] __________________
[42, -3, 4, 15, 9] _____________
[30, 20, 10, 60, 50, 40] _____________