Suppose that items A, B, C, D and E are pushed, in that order, onto an initially empty stack S. S is then popped four times; as each item is popped off, it is inserted into an initially empty queue. If two items are then removed from the queue, what is the next item that will be removed from the queue? 1. A. item A B. item B C. item C D. item D E. item E 2. If the binary tree below is printed by a preorder traversal, what will the result be? 17 9 4 16 12 A. B. C. D. E. 9 4 17 16 12 11 6 9 17 6 4 16 22 12 6 9 174 16 22 12 6 17 22 9 4 16 12 6 17 94 22 16 12