Tony Gaddis supplement book:

8.Sorting Benchmarks

Modify the method 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 method on a different array, and display the number of exchanges made by each algorithm

Please have method classes and demo class

and make a UML diagram for better understanding of what is going on in each ,java class

Thank you!