difficulty with writing mergesort2

Problem Description You have been given the Algorithm 2.5 titled mergesort2. You are requested to implement the mergesort2 and sequentialsort algorithms using C++, Java, or C Sharp language. You are requested to write a code to show their time consumption, using different samples, and draw the time consumption graph. It is alleged that the mergesort2 algorithm performs better than the traditional sequential search. Demonstrate that by analyzing the complexity of the two algorithms and by referring to the generated graph. Algorithm 2.5: Mergesort2 Problem: Merge the two sorted subarrays of S created in Mergesort 2. Inputs: indices low, mid, and high, and the subarray of Sindexed from low to high. The keys in array slots from low to mid are already sorted in nondecreasing order, as are the keys in array slots from mid + 1 to high Outputs: the subarray of Sindexed from low to high containing the keys in nondecreasing order. void merge2 (index low, index mid, index high index ijk: keytype Ullow..highl: // A local array merging i = low; j = mid + 1; 1 = low: while (i s mid Ej s high) { (S[i] mid) moves through Shigh to Uk through Uhigh): move S[i] through smid to Uk] through Ul nigh): move Ullow through U[high to Sllow through Shighl: Content of your submission: You are request to create your own examples to run the algorithms and show their time complexity. The complete submission must consist of the following: - Implementation of MergeSort2 algorithm (code file) - Implementation of SequentialSort algorithm (code file) Code to generate used time for Mergesort and SequentialSort Draw the actual graph using the generated used times A report to discuss the algorithms showing their time complexity