Write a program in C that removes the head of a linked list and prints its content as well as freeing the deleted head node,

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;

// delete the head node in this function

student_cell_T *Delist(linked_list_T *list){

// write code here

}

void printList (linked_list_T* list){

// print the recently deleted head node info here.

}