while (IpriQueue.isEmpty O) System.out.println (priQue.remove 0) The numbers printed to the screen would be: a. 1746 109 b. 9 10 6471 c. 14679 10 d. 1097641 e. 9641 7 10 16. The values are pushed onto Stack s in the order that they appear below (left to right) 17 4 6 10 9 The values are then popped off the stack. As each value is popped off the stack, it is inserted into a binary search tree. The values in the tree are printed by visiting the nodes in the tree with a preorder traversal. The numbers printed to the screen would be: a. 1746 10 9 b. 64910 7 1 c. 14679 10 d. 109 7641 e. 96417 10 ieihia integers