17. Suppose the keys 3, 4, 45, 21, 92, 12 are inserted into a BST in this order. What is the preorder traversal of the elements? a) 3 412 21 45 92 b) 34 45 21 12 92 c) 12 21 92 45 4 3 d) 445 2112 92 3 e) 4 21 12 92 45 3 7) 8) is a data structure to store data in sequential order. a) A list b) Aset c) A tree d) A stack e) A queue If an application uses a list that needs to be resized repeatedly, you choose: (from the Java API) a) A linked list b) A Resizable Vector c) An ArrayList d) An iterator e) A FlexSize list 9) 10) ArrayList is more efficient than LinkedList for the following operations: a) Insert/delete an element in the middle of the list. b) Insert/delete an element in the beginning of the list. Insert/delete an element at the end of the list. c) d) Retrieve an element given the index. 11) The worst-time complexity for bubble sort is b) Oflogn) c) O(n) d) O(nlogn) e) O(n*n) 12) 4. Which of the following complexity is O(nlogn)? a) 300n +400n*n b) 23nlogn+50 c) 45n + 45nlogn+503 d) n'n*n+ nlogn