Write a program to compute the number of collisions required in a long random sequence of insertions using linear probing, quadratic probing, and double hashing. implements the different collision resolutions methods, the program wil als take large input files of random numbers, at the end output a report on the count of collions each method. CODE IT IN JAVA.

Write the Java method scrambleArray, a void method that returns with the values of given double array scrambled (i.e., randomized).

Write a client that runs sort() on difficult or pathological casesthat might turn up in practical applications. Examples include arrays that are alreadyin order, arrays in reverse order, arrays where all keys are the same, arrays consisting ofonly two distinct values, and arrays of size 0 or 1.

Write a Java method that receives a two-dimensional array of primitive ints ( int [] [] ). The array can have any number of rows and any number of items per row. Also, the array can be “ragged” (not all rows have the same number of items). Have the method return the average of all of the items in the array as a primitive double.

Write a Java method named addArray which takes two arrays of same size as parameters. The method should return a third array that is the element-wise sum of the two arrays. For example, if the two input arrays are [1,2,3] and [4,5,6], then the returned array should be [5, 7, 9].                             [  1,   2,   3]                         + [  4,   5,   6]                         = [1+4, 2+5, 3+6] = [5,7,9] Call addArray in main method to test the above example. Print the returned array in the main method. Write a JAVA code please

Write a Java method that counts increasing sets in an integer array. The sets do not overlap. Example: 10,9,9,4,5 Output would be 3(10) (9,9) (4,5)