In this part, you will be writing another simple C program such that the program will take name of the input file as command

line argument $$ name of the input file $$ text file. If there is no argument, it should write a usage message $($indicating how

to use this program$)$ and terminate. Otherwise, it should recover the argument and from the provided file, read the list of

numbers.

$2.$ Now sort the list within the program in ascending order using any sorting algorithm that you may know or have studied

in the past. No external sorting or call to any sorting utility is allowed. If you use external sorting, you will lose $50\%$

of your marks.

$3.$ Calculate persistence of each of the number in the sorted list.

$4.$ Find the number with the smallest and the largest persistence values and print both the numbers and their corresponding

persistence values.