An alternate method of storing a string is to store each letter of the string in a single node of a linked list, with the first node of the list storing the first letter of the string. Using this method of storage, no null character is needed since the next field of the node storing the last letter of the string would simply be a null pointer. In this program, you are going to complete the missing below functions in the attached C-file. This program reads the input from the attached input.txt file in the following format: 36abcdef412342cm When the chars "abcdef" are read, your program will construct a linked list as follows: You are going to implement the following functions: int length(node* head) char* tocstring(node* head) void insertChar(node** pHead, char c) void deletelist(node** pHead) Once you are done, please upload the C-file. We are going to compile and run your C-file to grade