hi i really need help i am really lost in this program if any one can help me with it plz contact me on my email * <<mail id snipped>>*

(using c++ program)

1. Write a computer program that implements the recursive merge sort.

The input to the program must be a small list of elements (e.g. 10 to 20 integer numbers). The program must sort the input list and produce a sorted list using the recursive merge sort.

The program must first display the list to be sorted. The program must also display the sublists into which the original list is split during the recursive merge sort process. The program must also display the lists into which the sublists are subsequently merged to form the final sorted list.

2. Big-O estimate of the merge sort.

Give a big-O estimate of the complexity of the merge sort algorithm that you wrote. Justify your big-O estimate of the complexity of the merge sort algorithm with reference to the splitting process of the merge sort and the subsequent merge of these sublists into the final sorted list as illustrated by your program output

0