Implement in Java with comments

Task #1 Program: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort and Quick Sort to sort a list of n elements. Carry out a complete test of your sorting algorithms with n -10,000, 20,000, 50,000, 100,000,.. (up to the largest size of n that your computer can handle You should stop the program for any method if it takes more than 10 minutes to run). Report your results. (80 Pts) Task #2 For each sorting method, record the sorting time for different number of n and then graph time vs. n. Write a detailed report and compare all sorting algorithms in terms of their time complexities. Explain if your empirical results are consistent with theories. (20 Pts) Task #1 Program: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort and Quick Sort to sort a list of n elements. Carry out a complete test of your sorting algorithms with n -10,000, 20,000, 50,000, 100,000,.. (up to the largest size of n that your computer can handle You should stop the program for any method if it takes more than 10 minutes to run). Report your results. (80 Pts) Task #2 For each sorting method, record the sorting time for different number of n and then graph time vs. n. Write a detailed report and compare all sorting algorithms in terms of their time complexities. Explain if your empirical results are consistent with theories. (20 Pts)