Do experimental analysis in order to evaluate the highest value of n so that the defined algorithm takes about 1 minute. (The parameter for each approach can be simply passed through an array of random integers).

1 /** Returns true if there are no duplicate elements in the array. */ 2 public static boolean uniquel (int[] data) { 3 int n = data.length; 4 for (int j=0; j<-1>