For the C code that uses the code listing below: #include…
For the C code that uses the code listing below: #include #include typedef struct{int BuckID;char *name;} Student; struct Node{Student student;struct Node *next;}; Student *getStudent(int i){Student *p = calloc(1, sizeof(Student));p->BuckID = 1000+i;p->name = “Smith”;return p;} void printStudent( struct Node *node){ printf(“%i: %s\n”, node->student.BuckID, node->student.name);} int main(){ printf(“Hello World”); return 0;} Implement a queue of students using the linked list principles. Specifically, write the Enqueue(), Dequeue(), and printQueue() functions to add, remove, and print students from the queue, respectively. Add the main function that calls these functions. Copy your full code listing to the Carmen exam.