What does the following Python code snippet accomplish?def reverse_linked_list(head):    prev = None    current = head    while current is not None:        next_node = current.next        current.next = prev        prev = current        current = next_node    head = prev    return headDeletes the last node of the linked listInserts a new node at the beginning of the linked listReverses the linked listSorts the linked list in ascending order

f reverse_linked_list(head):    prev = None    current = head    while current is not None:        next_node = current.next        current.next = prev        prev = current        current = next_node    head = prev    return headDeletes the last node of the linked listInserts a new node at the beginning of the linked listReverses the linked listSorts the linked list in ascending order

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

What is the output of the following Python code snippet?class LinkedList:    def __init__(self):        self.head = None    def append(self, data):        new_node = Node(data)        if self.head is None:            self.head = new_node        else:            current = self.head            while current.next:                current = current.next            current.next = new_node    def display(self):        current = self.head        while current:            print(current.data, end=" ")            current = current.nextll = LinkedList()ll.append(1)ll.append(2)ll.display()

he following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function./* Link list node */struct node{    int data;    struct node* next;};  /* head_ref is a double pointer which points to head (or start) pointer   of linked list */static void reverse(struct node** head_ref){    struct node* prev   = NULL;    struct node* current = *head_ref;    struct node* next;    while (current != NULL)    {        next  = current->next;          current->next = prev;           prev = current;        current = next;    }    /*ADD A STATEMENT HERE*/}  What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked 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