Question 1 (15 marks) Short Answer (maximum 20 words): Answer all five parts below. Part A (3 marks): What is the worst-case time complexity for binary search on a BST with n elements? Explain. Part B (3 marks): The first time you run algorithm A on a dataset of n elements; it is faster than algorithm B. The second time you run algorithm A on a dataset of n elements; it is slower than algorithm B. Explain how this is possible. Give an example for algorithm A and algorithm B. Part C (3 marks): Your co-worker has implemented binary search for sorted linked-lists. Assuming a list with n elements, explain why this algorithm will be slower on average than using linear search. What is the average time complexity of your co-worker's algorithm? Part D (3 marks): Assuming that you must start at the root, what is the best-case time complexity to find the smallest element in a BST with n elements? Draw an example with at least 4 nodes. Part E (3 marks): You have a binary tree with n elements that is not in sorted order. What is the time complexity to find the smallest value? Explain