Problem 3 Below you will see a partial implementation of Merge Sort. Please complete the implementation. You are only allowed to insert code INSIDE the "INSERT CODE HERE" area. The MergeSort function is the main function of the sorting. The input parameters include the array to be sorted, the starting index and the ending index. We need to pass in the indices because we need to recursively sort part of the array (sublists"), so the indices specify which part of the array will get sorted . The DoMerging is a helper function for MergeSort; what it do is simple: merge the sublist from startlndex to midIndex with the sublist from midIndex+1 to endindex. This is the part you need to complete Please read through the program and make sure you understand the function MergeSort before you start. Also please read through the lecture notes on MergeSort if you forgot how merging is done already. #include int bi180] Itemporary array used formerging void DoMerging(int a int startIndex, int midIndex, int endIndex) /Here we should merge the subllists afstartIndex] to a[midIndex] with // almidIndex+1] to a[endIndex] together into b, in ascending order / Please consult lecture notes for an example of how the merge is done! II Please use b[] as temporary array for merging // NSERT CODE HERE // copy the result from b[l back to a int k printf("Merge Result:) for(k startIndex; k