1) We would like to delete the root node in the binary tree above. Which ore is the corred unwer ther deletion (20p) ? 2) Let the sequence 3578912.1525 be given. We are searching sor the numuet 3 with the binary search algorithm (15p) ? a) 15 b) 8 c) 7 d) 25 e) 9 3) What is the complexity of the problem given in question? (Remember our last lecturell (300) a) 3 b) log3 c) log23 d) log1e8 e) log28 4) Let the sequence 137105924 be given. With the insertion sort algorithm, when we have 3 cards in our laht hand. which ones will they be, respectively (20p) ? a) 137 b) 1097 c) 124 d) 123 e) 1710 5) A priority queue is given below. We wquld like to add the letter f with priority 3 . Where can we insert? (ISp)