Apply the merge sort on the following list and sort the list in decreasing order:9198 29 93 98 53 68 333347You must show how the list is divided by the recursive calls to MERGE-SORT,then merged at each stage to obtain the final sorted list.

NOTE - I have used C++ programing language to solve the problem. Here I have defined the recursive function named mergeSort() to traverse the left and right array on the basis of the middle value till the elements are not divided into single values and then merge them by sorting in descending order. The function merge() is used to store the sorted values from left and right into 2 sub-arrays and then merge them by comparing them on the basis of descending order to the original array. In the main method, I printed the array before and after the sorting.C++ code: #include <iostream> using namespace std; // function to create 2 sorted sub-array and merge them in sorted order void merge(int *arr, int start, int end) { int mid = (start + end) / 2; int len1 = mid - start + 1; int len2 = end - mid; int *first = new int[len1]; int *second = new int[len2]; // copy the values int mainArrIndex = start; for (int i = 0; i < len1; i++) { first[i] = arr[mainArrIndex++]; } mainArrIndex = mid + 1; for (int i = 0; i < len2; i++) { second[i] = arr[mainArrIndex++]; } // merge 2 sorted array int index1 = 0; int index2 = 0; mainArrIndex = start; while (index1 < len1 && index2 < len2) { if (first[index1] > second[index2]) arr[mainArrIndex++] = first[index1++]; else arr[mainArrIndex++] = second[index2++]; } while (index1 < len1) { arr[mainArrIndex++] = first[index1++]; } while (index2 < len2) { arr[mainArrIndex++] = second[index2++]; } cout << "[ "; for (int i = 0; i < len1; i++) cout << first[i] << " "; cout << "] [ "; for (int i = 0; i < len2; i++) cout << second[i] << " "; cout << "]\n"; } // recursive function void mergeSort(int *arr, int start, int end) { // base case if (start >= end) { return; } int mid = (start + end) / 2; // sorting the left side using recursion mergeSort(arr, start, mid); // sorting the right side using recursion mergeSort(arr, mid + 1, end); // merging the array merge(arr, start, end); } // main method int main() { int arr[10] = {47, 98, 29, 93, 98, 53, 68, 33, 91, 33}; int n = 10; cout << "Array before sorting\n"; cout << "***********************\n"; for (int i = 0; i < n; i++) { cout << arr[i] << " "; } cout << "\n\nArray during sorting\n"; cout << "***********************\n"; mergeSort(arr, 0, n - 1); cout << "\nArray after sorting\n"; cout << "***********************\n"; for (int i = 0; i < n; i++) { cout << arr[i] << " "; } return 0; } Screenshot of the output: Hope it helps!!