Need Java code for the following question

8. Sorting Benchmarks Modify the methods presented in this chapter that perform the bubble sort, selection sort, insertion sort, and Quicksort algorithms on an int array, such that each method keeps a count of the number of swaps it makes. Then, write an application that uses four identical arrays of at least 20 integers. It should call each method on a different array, and display the number of exchanges made by each algorithm.

Ratings will be given to the correct answer, thank you.

8. Sorting Benchmark s Modify the methods presented in this chapter that perform the bubble sort, selection sort, insertion sort, and Quicksort algorithms on an int array, such that each method keeps a count of the number of swaps it makes Then, write an application that uses four identical arrays of at least 20 integers. It should call each method on a different array, and display the number of exchanges made by each algorithm