What is the functionality of the following code?Public void function(node node) { if(size == 0) head = node; else { node temp,cur; for(cur = head; (Temp = cur.Getnext())!=Null; cur = temp); cur.Setnext(node); } size++; }Select one:a. Inserting a node at the beginning of the list.b. Deleting a node at the beginning of the list.c.Inserting a node at the end of the list.d.Deleting a node at the end of the list.

What does the following Python code snippet do?def delete_node(self, key):    temp = self.head    if temp is not None:        if temp.data == key:            self.head = temp.next            temp = None            return    while temp is not None:        if temp.data == key:            break        prev = temp        temp = temp.next    if temp == None:        return    prev.next = temp.next    temp = None

What does the following Python code snippet accomplish?class LinkedList:    def __init__(self):        self.head = None    def insert_at_beginning(self, data):        new_node = Node(data)        new_node.next = self.head        self.head = new_nodeInserts a new node at the beginning of the linked listDeletes the last node of the linked listAppends a new node to the end of the linked listReverses the linked list

Linked List Operations: Traverse, Insert and DeleteTraversal - access each element of the linked list.Insertion - adds a new element to the linked list.Deletion - removes the existing elements.Search - find a node in the linked list.Sort - sort the nodes of the linked list.

Public void function(node node) { if(size == 0) head = node; else { node temp,cur; for(cur = head; (Temp = cur.Getnext())!=Null; cur = temp); cur.Setnext(node); } size++; }

Problem Statement23hr leftGiven a linked list, write a program to insert or delete nodes from the beginning.Input:n = 5[6, 5, 4, 3, 2, 1]Notice that here, we are inserting each element from the beginning. Hence when you insert a new element, the list becomes newEle + OldLL.For example, if you add 3 to [4, 5, 6] then it becomes [3, 4, 5, 6].Output:[1, 2, 3, 4, 5, 6] -> after inserting elements [2, 3, 4, 5, 6] -> after deleting the beginning elementConstraint:If the linked list is empty, print an empty space.