C++ Program: find the middle node in the linked list. You need reading integers from a text file ; using insertion sort the task is to construct an ordered linked list (in ascending order).

Input: put the giving integers list below in a text file.

91 322 9 10 77 8 999 12 133 14 8 538 29 91 88 702 361 637 99

II. inFile (use argv[1]): A text file contains a list of integers

********************************

II. outFile1 (use argv[2]): a text file includes

i) The completed sorted linked list;

ii) The memory address and the data in the middle node

outFile2( use argv[3]): All debugging outputs.