Using Java! In this assignment, you will implement the Insertion Sort and Bubble Sort algorithms $($please see the slides for the respective algorithm$)$ in your chosen language and sort at least $10000$ integers to compare the running time for both algorithms.

Write a function to generate $($n $>=10000)$ random integers within the range $1-10000.$

Write two functions BubbuleSort$($Array$[1....$n$],$ n$)$ and InsertsionSort$($Array$[1....$n$],$ n$)$ that sort the generated random integers in ascending orders

Compare the running time. long startTime $=$ System.nanoTime$()$;

BruteForceMethod$($arr$)$;

long endTime $=$ System.nanoTime$()$;

System.out.println$("$Total time for brute force: $"+($endTime$-$startTime$)+"$ nano seconds"$)$;