Erform the Insertion Sort, Bubble Sort, Merge Sort, and Quick Sort algorithms on an int array, such that each program keeps a count of the number of swaps it makes. Then, write an application that uses four identical arrays of a least 20 integers. It should call each method on a different array, and display the number of exchanges made by each algorithm. Also, explain in detailhow each sort algorithm works (use word doc format).