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.        

List in sequential order, the steps to buying a soda in a ve…

List in sequential order, the steps to buying a soda in a vending machine using the Procedural Task Analysis Method. 1 point for each correct step for a total of 10 points. Assume you are standing in front of the vending machine. Assume you will use a credit card to pay for the soda. Include the following for each step: Action verb How the action takes place Objects used (# and what they are) Time to complete the task Amount  and type of supplies used.