Consider the following linked list (LL is pointing to the sentinel node):

Assume each node is a struct node(int data; struct node *next;)

a) What will be printed by the following statement?

printf(%d %d ", LL->next->next->data, LL->next ->data);

_____________________________________________

b) write some C code to delete the last node of the list, without using any loops or conditional statements. Be sure to free the nodes memory too.

12 14 8 NULL