Insertion Sort In C++ Implement insertion sort to sort an array/vector of integers. Name one program Merge Sort.

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:

10 10 9 8 7 6 5 4 3 2 1

3 1 1 1

5 9 8 2 3 3

The output will be written to files called Merge.out.

For the above example the output would be:

1 2 3 4 5 6 7 8 9 10 10

1 1 1 3

2 3 3 5 8 9