Question 3 ( 20.0 marks) Your lecturer is a funny guy; given an unsorted list of n numbers, he will use the following recursive searchMax algorithm to do the search: The algorithm divides an array of n elements into two halves; find the highest value of each half, then return the highest of the two to search the highest number of the entire list. (i) Let T(n) be the running time of the recursively written searchMax algorithm. Derive and express the recurrence relation that describes the running time of searchMax (List , startIdx, size ) as a function of n. (10 marks) (ii) Solve the recurrence equation T(n) to determine the upper bound complexity of the recursive searchMax () algorithm implemented in part (i). (10 marks)