Language Java detailed walk-through of the code for better understanding and readability thank you.

Write the program(in your preferred language choice) implementation that combines the bubble sort and the quicksort algorithm, where you take input list 3 (of say up to 1000 items), and perform two iterations with the bubblesort, and the remaining sorts with the QuickSort routine. As in part A provide the empirical analysis of these results. How does the results compare when the list is fairly sorted with those of the list when they are randomly unsorted. Input # 3 : 1,2,3,24, 19,7,28,47,9. ( say up to 1000 items ]