C++ simple program

Part A: Implement recursive merge sort Part B: Terminate the recursion for merge sort, when the size of the segment is at most 10 (H −L ≤ 10 ), and then use insertion sort write 2 separate programs. For part A write a program for merge sort using C/C++ programming language. Take your array size to be [login to view URL] should use recursive Merge sort. For part B combine merge sort with insertion sort. You should terminate the recursion for merge sort, when the size of the segment is at most 10 (H −L ≤ 10), and then use insertion sort. Your program should read from a file called [login to view URL] and write to a file called out1.txt. Your program must sort the numbers in each line in the input file. Example input: 25 800 -2 100 200 400 20.57 37 Example Output: -2 25 100 800 20.57 37 200 400