write two functions in C, one that adds an element to the end of a linked list and one that removes an element at the head of the linked list

skeleton code below:

typedef struct student_cell_T { int id; double gpa; char *name; // name is just a pointer here, you need to allocate space for name struct student_cell_T *next; } student_cell_T;

typedef struct linked_list_T { student_cell_T *head; student_cell_T *tail; } linked_list_T;

//This function adds a student cell pointed by element to the end of the list. void Enlist(linked_list_T *list, student_cell_T *element) {

}

//This function removes the student cell at the head of the list. If the list is empty, Delist prints an Error and returns NULL. student_cell_T *Delist (linked_list_T *list) {

}

write the code in C