Provided code as reference required:

import java.util.Arrays;

/** * Demonstration of algorithms for testing element uniqueness. * * @author Michael T. Goodrich * @author Roberto Tamassia * @author Michael H. Goldwasser */ class Uniqueness {

/** Returns true if there are no duplicate elements in the array. */ public static boolean unique1(int[] data) { int n = data.length; for (int j=0; j

/** Returns true if there are no duplicate elements in the array. */ public static boolean unique2(int[] data) { int n = data.length; int[] temp = Arrays.copyOf(data, n); // make copy of data Arrays.sort(temp); // and sort the copy for (int j=0; j

}

Please ensure you add comments on your changes.

If your first name starts with a letter from KZ inclusively: For each of the algorithms uniquel and unique2 (Uniqueness.java class in Lesson 4 examples) which solve the element uniqueness problem, perform an experimental analysis to determine the largest value of n such that the given algorithm runs in one minute or less. Hint: Do a type of "binary search" to determine the maximum effective value of n for each algorithm