2. (30 points) Consider the following linked list (list is the address of the sentinel node): list 10 -5 +--> 100 | +--> 256|| +--> 1 1 | NULL Assume each node is a struct node {int data; struct node *next;} (a) what will be printed by the following statement? printf("%d %d ",list->next->next->data, list->next->data); (6) write some C code to delete the last node (256) from the list, without using any loops or conditional statements. Be sure to free the node's memory too. (C) write some C code to create (using malloc) a new node named "new" with a data value of 87 a) write some C code to insert that new node between the -5 and the 100 (again, without using any loops or conditionals)