Consider the pseudo-code below: ALGORITHM MaxElement (A[0..n1]) //Determines the value of the largest element in a given array //Input: An array A[0..n1] of real numbers //Output: The value of the largest element in A maxval A[0] for i1 to n1 do if A[i]> maxval maxval A[i] return maxval a. What is the basic operation of this algorithm? b. Give the best-case and worst-case time complexities of this algorithm in asymptotic notation. Consider the algorithm below and give its best-case and worst-case time complexities in asymptotic notation. ALGORITHM UniqueElements (A[0..n1]) //Determines whether all the elements in a given array are distinct //Input: An array A[0..n1] //Output: Returns "true" if all the elements in A are distinct // and "false" otherwise for i0 to n2 do for ji+1 to n1 do if A[i]=A[j] return False return True