1. Write a Java program that • Define an integer array with a length of 10. • Populate the array with random integer numbers. • Sort this array into non-decreasing/decreasing order based on three sorting algorithms.         #bubble sort         #selection sort         #Insertion sort • Test these 3 sorting methods • Give a big-Oh characterization, in terms of n, of the running time of these three algorithms. • Improve the bubble sort so that the time complexity of them are O(N) for the best case

java

JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Perform algorithm time measurement for all three quadratic sorting algorithms for Best Case (already sorted), Average Case (randomly generated), and Worst Case (inverse sorted) inputs and compare them with O(N*logN) sorting algorithm using Arrays.sort() method. Use arrays sizes of 50K, 100K, and 200K to produce timing results. Ignore the message "There is an infinite loop!" that appears on HyperGrade after submitting your program. Unfortunately, HyperGrade is designed to limit the amount of time that your program is allowed to execute.

Answer the given question with a proper explanation and step-by-step solution. java