Consider the "Element Uniqueness" problem discussed in class. The problem s: Given an array determine whether the elements in the array are distinctly unique or not. For example, the array [3. 5, 9. 2, 1] has unique elements. The array [4, 9, 4, 2, 3] does not have unique elements as element 4 is present more than once. Following is the algorithm to determine whether a given array A[O.n-1 of size n has unique elements or not. ALGORITHM Unique Elements(A[O..-1 /Determines whether all the elements in a given array are distinct /Input: An array A[O. 1 Output: Returns "true" if al the elements in A are distinct and "false" otherwise for j i + I to n-1 do if A[i]-AL/ ] return false return true The run-time of the algorithm is dependent on the number on the number of comparisons, which is the basic operation. For a given array size n, the number of comparisons depends on the contents of the array, i.e., the values of the elements of the array For arrays of any size >1, the best-case number of comparisons is 1. This will happen when the first and second elements of the array are the same