2. Consider the algorithm below and give its best-case and worst-case time complexities in asymptotic notation. ALGORITHM UniqueElements (A[0..n - 1]) //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