(chapter 13- sorting)

This below question is from data structure c++, please read carefully what its asking for and give me a short c++ code.

Mergesort void meraesort(int datal J, size t n) size tn1; // Size of the first subarray size t n2; II Size of the second subarray Divide the array in the middle Sort the two half-arrays by recursion Merge the two halves if (n > 1) // Compute sizes of the subarrays. o n2 n-n1 // Sort from data[0] through data[n1-1] mergesort(data, n1); I/ Sort from data[n1] to the end mergesort (data + n1), n2); // Merge the two sorted halves. merge(data, n1, n2); @ Zhigang Zhu, 2004-2018