Starter Code : Pls use the relevant variables present in th

Starter Code : Pls use the relevant variables present in the sarter… Starter Code : Pls use the relevant variables present in the sarter code to write the solution.  #include #include #include #define MAX_LIST_LEN 100struct node {   struct node *next;   int          data;};struct node *delete_first(struct node *head);struct node *array_to_list(int len, int array[]);void print_list(struct node *head);static void free_list(struct node *head);// DO NOT CHANGE THIS MAIN FUNCTIONint main(void) {   // get list size   int list_size;   printf(“Total numbers: “);   scanf(” %d”, &list_size);   // read in numbers   int list[MAX_LIST_LEN] = {0};   int index_count = 0;   while (index_count < list_size && scanf(" %d", &list[index_count])) {       index_count++;   }   // create linked list from input numbers   struct node *head = NULL;   if (index_count > 0) {       // list has elements       head = array_to_list(list_size, list);   }   struct node *new_head = delete_first(head);   print_list(new_head);   free_list(new_head);   return 0;}//// Delete the first node in list.// The deleted node is freed.// The head of the list is returned.//struct node *delete_first(struct node *head) {   // PUT YOUR CODE HERE (change the next line!)      }// DO NOT CHANGE THIS FUNCTION// create linked list from array of intsstruct node *array_to_list(int len, int array[]) {   struct node *head = NULL;   int i = len – 1;   while (i >= 0) {       struct node *n = malloc(sizeof (struct node));       assert(n != NULL);       n->next = head;       n->data = array[i];       head = n;       i–;   }   return head;}// DO NOT CHANGE THIS FUNCTION// print linked listvoid print_list(struct node *head) {   printf(“[“);   for (struct node *n = head; n != NULL; n = n->next) {       // If you’re getting an error here,       // you have returned an invalid list       printf(“%d”, n->data);       if (n->next != NULL) {           printf(“, “);       }   }   printf(“]n”);}// DO NOT CHANGE THIS FUNCTION// free linked liststatic void free_list(struct node *head) {   if (head != NULL) {       free_list(head->next);       free(head);   }} Image transcription textDelete First Element from a Linked List Download list_delete_first.c here, or copy it to your CSE account usingthe following command: $ cp -n /web/cs1511/2212/activities/list_delete_first/list_delete_first.c . Your task is toadd code to this function in list_delete_first.c: 11 // Delete the first node in list. // The deleted nod… Show more… Show more pls declare variables, so they dont lead to errors.  much appreciated. Engineering & Technology Computer Science COMP 1511

How it works

1. Paste your instructions in the instructions box. You can also attach an instructions file
2. Select the writer category, deadline, education level and review the instructions 
3. Make a payment for the order to be assignment to a writer
4.  Download the paper after the writer uploads it 

Will the writer plagiarize my essay?

You will get a plagiarism-free paper and you can get an originality report upon request.

Is this service safe?

All the personal information is confidential and we have 100% safe payment methods. We also guarantee good grades