Merge Sort and Insertion Sort Programs

Implement merge sort and insertion sort to sort an array/vector of integers, using C++. You may implement the algorithms in the language of your choice, name one program mergesort and the other insertsort. Your programs should be able to read inputs from a file called data.txt where the first value of each line is the number of integers that need to be sorted, followed by the integers. Example values for data.txt: 4 19 2 5 11 8 1 2 3 4 5 6 1 2 The output will be written to files called merge.out and insert.out. For the above example the output would be: 2 5 11 19 1 1 2 2 3 4 5 6