I want help for writing the codes using the linked list in the merge sort as mentioned above.

Can I know what informations are required?

Goal: Implementation of mergesort using linked list ideas for tables. Requirements: 1. Write a program to read an input sequence and then produce an array of links giving the values in ascending order. The first line of the input file is the length of the sequence (n) and each of the remaining n lines is a non-negative integer. The first line of the output indicates the subscript of the smallest input value. Each of the remaining output lines is a triple consisting of a subscript along with the corresponding input sequence and link values. 2. Submit your program on Canvas by 12:45 p.m. on February 17. One of the comment lines should include the compilation command used on OMEGA (5 point penalty for omitting this). Getting Started: 1. Your program should read the input files by using Unix shell redirection (e.g. a.out 5 Purt First is tot Goal: Implementation of mergesort using linked list ideas for tables. Requirements: 1. Write a program to read an input sequence and then produce an array of links giving the values in ascending order. The first line of the input file is the length of the sequence (n) and each of the remaining n lines is a non-negative integer. The first line of the output indicates the subscript of the smallest input value. Each of the remaining output lines is a triple consisting of a subscript along with the corresponding input sequence and link values. 2. Submit your program on Canvas by 12:45 p.m. on February 17. One of the comment lines should include the compilation command used on OMEGA (5 point penalty for omitting this). Getting Started: 1. Your program should read the input files by using Unix shell redirection (e.g. a.out 5 Purt First is tot