dont use the arrays.sort() method, write the long version of the sorting, linear search, and binary search.

using java programming language

write and array class that implements the search and sort method, then write a program to test your class. Has to have: - Create an int array of size 10,000,000. -Generate numbers between 1 and 10000 and then store them in the array. -Implement thesort method to sort the array. -Implement the search method(linear search and binary search). -generate an array of 5000 keys in the range of 1 to 10000, then search for each key using both linear and binary seach (separately) and record it in another array (one for linear one for binary). - Recored in a new array the number of steps needed to fine each key, and in another array the time it toke to fined them. -Then print the best, worst, and average cas in terms of number of steps and the time it needed to fine solution