can anyone solve this.

Part A(70 points): Implement recursive merge sort. Write a program for merge sort using recursion. Part B(30 points): Combine merge sort with insertion sort as instructed in class. This means you terminate the recursion for merge sort, when the size of the segment is at most 6 (H-L