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 enitire sorting process. (If you need additional space, complete it at the other side of the paper /Compare //storing the results in the temporary array and suap elements in the sub-array ite the array a with terp once the sort has been completed l-void serge sort(int (), int ett, int i, int t) if (left