C++ Write the code for the merge Sort function, assuming a merge function already exists and can be used in the implementation. merge Sort sorts an array of integers from a given start index for a given length. merge Sort(int arrayToSort[], int startIndex, int length ToSort) It will be required that the given startIndex and lengthToSort will not overrun the array bounds and Write the code for the merge function. This merges the contents of an array which has been sorted in 2 halves (from startIndex to length/2, and from startIndex + length/2 until the full sorted length) merge(int arraySortedIn TwoHalves[], int startIndex, int length) Tip: create (using new) a temporary array to hold the merged result, merge to this array, then copy back to the array to be merged, and delete the temp array)|