(Solved) : Implement Following Algorithms Java Insertion Sort Regular Quicksort Quicksort2 Quicksort Q26339987 . . . .

Implement the following algorithms in Java(Insertion Sort, Regular Quicksort, and Quicksort2 (Quicksort /Insertion Sort Combo)).
The only difference between Regular Quicksort and Quicksort2 isthat when n ≤ 16, Quicksort2 will not partition the list but callInsertion Sort instead.

Deliver a complete test of these algorithms with n = 2, 4, … ,up to 2^16. Run the program in an extra loop many times on the sameunsorted array, measure the total running time, and then divide itby the number of the loop’s repetitions. You can do this bygenerating an unsorted array of size n, and before the start ofeach loop copy its elements