11. search for the number 45. Which of the following sequences could be the sequence of nodes examined? Suppose that we have numbers between 1 and 100 in a binary search tree and want to A) 5, 2, 1, 10, 39, 34, 77, 63 B) 1, 2, 3, 4, 5, 6, 7,8 C) 9, 8, 63, 0, 4, 3, 2,I D) 50, 25, 26, 27, 40, 44, 42 E) 8, 7, 6,5,4, 3, 2, 2. What is the expected number of comparisons for unsuccessful search in a hash table of size 15 in which 30 keys are stored, assuming that the chaining collision resolution mechanism is used? A) I B) 2 C) 3 D) 4 E) None of the above 13. Which sorting algorithm is the most efficient when the input array is almost sorted A) Merge Sort B) Quick Sort C) BST D) Insertion Sort E) Heap Sort 14. Using asymptotic notation, give an upper bound for the height of a binary search tree containing n nodes. A) ?(log n) B) O(log n) C) O(n) D) O(n log n) E) ?(n) 15. Using asymptotic notation, give a lower bound for the height of a red-black tree containing n nodes. A) ?(log n) B) O(log n) C) O(n) D) O(n log n) E) 2(n)