I need help and tied to the requirements please. Exactly part B and D.

2. (20pts) Consider the following linked list (LL is pointing to the sentinel node): 2. (20 points) Consider the following linked list (LL is pointing to the sentinel node) 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 ",LL-> next-> next-> data, LL-> next->data); Part A: What will be printed by the following statements? printf(%d %d ", LL->next->nextdata,LL->next->data); 4 6 Part B: Write some code to delete the last node of the list, without using any loops or conditional statements. Be sure to free the node's memory too. Part C: Write some C code to create a new node, and point to it with a variable named "new". struct node *new-malloc(sizeof(struct node)); Part D: Write some C code to insert that new node between the 6 and the 4 (again, without any loops or conditionals)