Given a pointer to the head of a linked list, insert a new node before the head. The value in the new node should point to and the value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty.Function DescriptionComplete the function insertNodeAtHead in the editor below.insertNodeAtHead has the following parameter(s):SinglyLinkedListNode llist: a reference to the head of a listdata: the value to insert in the field of the new nodeInput FormatThe first line contains an integer , the number of elements to be inserted at the head of the list.The next lines contain an integer each, the elements to be inserted, one per function call.ConstraintsSample Input5383484392975321Sample Output321975392484383ExplanationIntially the list in NULL. After inserting 383, the list is 383 -> NULL.After inserting 484, the list is 484 -> 383 -> NULL.After inserting 392, the list is 392 -> 484 -> 383 -> NULL.After inserting 975, the list is 975 -> 392 -> 484 -> 383 -> NULL.After inserting 321, the list is 321 -> 975 -> 392 -> 484 -> 383 -> NULL.

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.Function DescriptionComplete the insertNodeAtTail function in the editor below.insertNodeAtTail has the following parameters:SinglyLinkedListNode pointer head: a reference to the head of a listint data: the data value for the node to insertReturnsSinglyLinkedListNode pointer: reference to the head of the modified linked listInput FormatThe first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail.ConstraintsSample InputSTDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values 141..474 302 164 530 474Sample Output141302164530474ExplanationFirst the linked list is NULL. After inserting 141, the list is 141 -> NULL.After inserting 302, the list is 141 -> 302 -> NULL.After inserting 164, the list is 141 -> 302 -> 164 -> NULL.After inserting 530, the list is 141 -> 302 -> 164 -> 530 -> NULL. After inserting 474, the list is 141 -> 302 -> 164 -> 530 -> 474 -> NULL, which is the final list.

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its attribute, insert this node at the desired position and return the head node.A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is empty.Example refers to the first node in the list Insert a node at position with . The new list is Function Description Complete the function insertNodeAtPosition in the editor below. It must return a reference to the head node of your finished list.insertNodeAtPosition has the following parameters:head: a SinglyLinkedListNode pointer to the head of the listdata: an integer value to insert as data in your new nodeposition: an integer position to insert the new node, zero based indexingReturnsSinglyLinkedListNode pointer: a reference to the head of the revised listInput FormatThe first line contains an integer , the number of elements in the linked list.Each of the next lines contains an integer SinglyLinkedListNode[i].data.The next line contains an integer , the data of the node that is to be inserted.The last line contains an integer .Constraints, where is the element of the linked list..Sample Input31613712Sample Output16 13 1 7ExplanationThe initial linked list is . Insert at the position which currently has in it. The updated linked list is .

How do you insert a new node at the beginning of a singly linked list?Group of answer choicesCreate a new node and adjust the next pointer of the new node to point to the current head nodeCreate a new node and set its next pointer to nullCreate a new node and adjust the previous pointer of the new node to point to the current head nodeCreate a new node and adjust the previous pointer of the current head node to point to the new node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value.ExampleAfter removing the node at position , .Function DescriptionComplete the deleteNode function in the editor below.deleteNode has the following parameters:- SinglyLinkedListNode pointer llist: a reference to the head node in the list- int position: the position of the node to removeReturns- SinglyLinkedListNode pointer: a reference to the head of the modified listInput FormatThe first line of input contains an integer , the number of elements in the linked list.Each of the next lines contains an integer, the node data values in order.The last line contains an integer, , the position of the node to delete.Constraints, where is the element of the linked list.Sample Input8206219741593Sample Output20 6 2 7 4 15 9ExplanationThe original list is . After deleting the node at position , the list is .

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)