I need to write a program that uses insertion, merge, quick and counting sort for the parts below in C++. I have attached a screenshot of the input files below and would like the program to have comments throughout it to explain each function.

a) The program implements insertion sort, merge sort, quick sort, and counting sort as subprograms or classes (radix sort is optional);

b) The program reads input from a data file specified by user and write the sorted output into another file;

c) Design your program in the way that it can accept users options such as:

*. Which sort algorithm to use;

*. Which sort order to use, that is, non-decreasing order or non-increasing order?

*. Whether should the output remove duplications?

f) Results and analysis: use your program to measure the running time on the set of input data files with different sort algorithms to sort in non-decreasing order without the removal duplication option. Normally you need to run each test for 10 times and report the average. Summarize the results in a table and/or a graph.

file10 txt (file10.txt), file 100 txt (file100.txt), file 1000 txt (file1000.txt), file 10000 txt (file10000.txt), file100000 txt (file100000.txt), f file1000000.bxt (ile 1000000.txt)