Write a function to read the numbers into an array. Modify Mergesort to record the number comparisons, and the number of data movements. Read in the random numbers from the text file into an array. Run the algorithm on the random array and print the number of comparisons and the number of moves

Recursively split the array into sub-arrays, merge the sub-arrays into a sorted list 7 public void mergeSorti intl data, int min, int max) if (min else { temp [index] first2++i = data [first2]; index++ /if we finished one subarray, finish the remainder of the other while (firstl