In C language Please.

The initial data poi ts ea out of the of alues wil be we wil be using he concepts rom project 2?test he more recent concepts o linked ists, pointers, and le dynamically allocated and then referenced via a pointer in a linked list. More details are: be store na e spect ca on ebelo each gn input file .first line will list the number of time steps to simulate . second line will include number of rows followed by the number of columns in the grid to be simulated . remaining lines in the file will have the positions of the initial cells that are 'alive' dynamically create nodes that use the following struct struct node t int rows; int columns; int grid; // a pointer to the grid that should be of size rows*columns struct node "next step a pointer to the node that holds the grid for the next time step 1: you will create a linked list of nodes where each node is a single time step the begin pointer should point to the initial grid, and each time step should follow. no array notation is to be used, so no D's should appear in your code. You MUST create the following functions struct node "createInitialNode(FILE input, int "numsteps); I/ read data from file pointer input and return a dynamically created node with the data and the number of time st eps to simulate in numsteps void nextStep(struct node *begin); the new timestep add a struct node to the end of the list pointed to by begin for the next time step, so use data in the last node in the list to create void printList(struct node begin); // print out all the grids contained in the list pointed to by begin The initial data poi ts ea out of the of alues wil be we wil be using he concepts rom project 2?test he more recent concepts o linked ists, pointers, and le dynamically allocated and then referenced via a pointer in a linked list. More details are: be store na e spect ca on ebelo each gn input file .first line will list the number of time steps to simulate . second line will include number of rows followed by the number of columns in the grid to be simulated . remaining lines in the file will have the positions of the initial cells that are 'alive' dynamically create nodes that use the following struct struct node t int rows; int columns; int grid; // a pointer to the grid that should be of size rows*columns struct node "next step a pointer to the node that holds the grid for the next time step 1: you will create a linked list of nodes where each node is a single time step the begin pointer should point to the initial grid, and each time step should follow. no array notation is to be used, so no D's should appear in your code. You MUST create the following functions struct node "createInitialNode(FILE input, int "numsteps); I/ read data from file pointer input and return a dynamically created node with the data and the number of time st eps to simulate in numsteps void nextStep(struct node *begin); the new timestep add a struct node to the end of the list pointed to by begin for the next time step, so use data in the last node in the list to create void printList(struct node begin); // print out all the grids contained in the list pointed to by begin