IN JAVA public class DuplicateDetection { public static void main (String[] argv) { // Make a large array and test. int[] X = makeData (10000); detectDuplicates (X); // We'll do this for data sizes of 10K, 30K, 50K, 70K and 90K. X = makeData (30000); detectDuplicates (X); X = makeData (50000); detectDuplicates (X); X = makeData (70000); detectDuplicates (X); X = makeData (90000); detectDuplicates (X); } static void detectDuplicates (int[] A) { // Check for duplicates. long startTime = System.currentTimeMillis(); boolean dupExists = false; for (int i=0; i 
  In-Class Exercise 6: Modify the above program to incorporate this optimization. Then, identify the new consiant of proportionality. In terms of n, what is the exact number of comparisons? (I's going to be smaller than (n-I), obviously)  In-Class Exercise 6: Modify the above program to incorporate this optimization. Then, identify the new consiant of proportionality. In terms of n, what is the exact number of comparisons? (I's going to be smaller than (n-I), obviously)