Write a Java program that Define an integer array with 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 $2.$ Write a Java program that Define an integer array with length of $100.$ Populate the array with random numbers in $\{1,2,$dots,$30\}.$ Count and output the frequency of each number occurred in the array. Give a big $-$ Oh characterization, in terms of $n,$ of the running time of this algorithm.