Assume that we are using merge sort algorithm to sort the following elements in the array 6, 5, 3, 1, 8,7,2,4. (20 pts.) 1- How total iterations it would take to complete the sorting process? 2- Simulate the entire sorting process. (If you need additional space, complete it at the other side of the paper) -//Compare and swap elements in the sub-array //storing the results in the temporary array //overwrite the array a with temp once the sort has been completed -void merge sort (int [, int eft, int rignt, intel) -if (left