1) Write a program to do the following a. Define an array of size (Constant value or passing a value to main method) b. Fill the array with random numbers between 1-SIZE c. Find how long it takes to search a number from the array d. Find how long it takes to sort using Insertion e. Find how long it takes to sort using Arrays.sort f. Find out how long it takes to search using Arrays.BinarySearch g. Try with array size of (100, 10000, 100000) Insertion Sort public static int[ insertionSort(int] data) // run from second element to last for (int i - l;