Please answer in C programming language

2. Write a function insertstudentA1pha (StudentList stuList, StudentType .stu) which takes as input a singly linked list (assumed to be sorted alphabetically by last name) and adds a student to stuList so that it remains in sorted order. 3. Write a function deletestudent (StudentList stulist, char fname, char name) which deletes the student with matching first and last names from the list. Assume that stulist is sorted alphabetically by last name. Use this assumption to minimize the number of comparisons needed in the case where a student is not in the list. This function should free memory for both the node and the data. If a student cannot be found, your function should return c NOK 4. Write a function cleanupList (StudentList "stulist) which frees all memory associated with stulist