Question 5 [20 marks] a. [10 marks] The algorithm to determine whether all clements in an array are distinct is given below. Algorithm UniqueElements(A[0.11-1]) //Input: An array A[O..n-1] //Output: Returns "true" if all elements in A are distinct and "false" otherwise for i 0 ton - 2 do for j i + 1 to n - 1 do if A[i] = A[j] return false return true Compute the time complexity of the above algorithm b. [10 marks] Consider the following algorithm Algorithm MaxIndex(A[r]) // ( = 0,r=n-1 //Input: A portion of array A[0..n-1) between indices and r( //Output: The index of the largest element in A[..] if {=r return { r) else templ - MaxIndex(A[l.. L(+ r)/2]] temp2 MaxIndex(A[L(1 + r)/2] +1..r]) if A[templ] > A[temp2] return temp/ else return temp2 Set up a recurrence relation for the number of key comparisons made by the above algorithm and solve the established recurrence by the backward substitution method for n = 24