specially want answer for question iv(language c only)

Actually want answer specially for part vi

Question 1 (25 marks) #include #include struct Node { int data; struct Node* next; void insertAtFrontOfLinkedList(struct Node** head_ref, int new_data) { struct Node"new_node = (struct Node)malloc(sizeof(struct Node)); new_node->data-new_data; new_node->next =("head_ref); ("head_ref) = new_node; } void insertAfterANode(struct Node previous fade, int data) { struct Node* new_node = (struct Node)malloc(sizeof(struet Node)); new_node->data = data: new_node->next = previous_node->next; previous_node->next = new_node; } void insertAtBackOfLinkedList(struct Node** ptr, int data) { struct Node new_node = (struct Node)malloc(sizeof(struct Node)); struct Node list"ptr, new_node->data-data; new_node->next = NULL; = while (list->next = NULL) list-list->next; list->next = new_node; 3 void deleteNode(struct Node** head_ref, int key) { struct Node temp ="head_ref"pres prev=NULL; if (temp = NULL && temp-datakey) { "head_ref-temp-Sne; free temp); return; while (temp = NULL && temp->data -key). prev=temp temp-temp-Sneat 3 if(temp NULL) Tetum; prevnext = temp->next free(temp): void printi.inkedList(struct Nodet per) { while(ptr - NULL) printf("%dit", ptr->data) ptr = ptr->next; Algorithm Q1 is a program to insert and delete a linked list. Consider the linked list in Figure Q1, using Algorithm Q1: head 3 NULL Figure Q1 Write a function call to display the linked list (2 marks) Write a function call to insert a new node after node 5 from Figure Q10 The new node has data - 10 (2 marks) a 111 . iv. Visualize the linked list after the new nod insertion in Q1(iii). (2 marks) Write a function call to insert a new node after node 2 from Figure Q10. The new node has data = 20. (2 marks) Visualize the linked list after the new node insertion in Q1(v). (2 marks) Write a main() function that will create the linked list in Figure Q1(1). Give three (3) possible solutions. (15 marks) V. vi