Implement 4 sorting algorithms in a Java "Sort" class. ( insertion sort, selection sort and quicksort, and mergesort). count the number of comparisons made. Make sure each sort is producing sorted data and a correct metric count. Pause each iterative sort after one repetition of the outer loop and pause Quicksort after each Partition is complete.

2. Randomly generate the appropriate number of integers and store in an array data member of the Sort class.