Question 8 0/1 pts Suppose we have two stacks: the first stack s1 has some values in it, while the second stack s2 is empty. Suppose we run the following code: while not s1.is_empty(): s2.push(s1.pop() After running this code, s1 is empty. What do we know about the contents of s2? s2 is empty. s2 has the same values stored in the same order as s1 originally had them. s2 contains only None values, because Stack.pop doesn't actually return anything. s2 has the same values stored in the reverse order as 51 originally had them. This code would not finish successfully; an error would be raised while running the code. Impossible to tell from the information provided. Question 9 0 / 1 pts Suppose we have two queues: the first queue q1 has some values in it, while the second queue q2 is empty. Suppose we run the following code: while not q1.is_empty(): 92. enqueue (91.dequeue()) After running this code, q1 is empty. What do we know about the contents of q2 ? O q2 is empty. q2 has the same values stored in the reverse order as q1 originally had them. O q2 has the same values stored in the same order as q1 originally had them. This code would not finish successfully; an error would be raised while running the code. o Impossible to tell from the information provided. O q2 contains only None values, because Queue.dequeue doesn't actually return anything