What does the following Python code snippet do?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_nodeDeletes the last node of the linked listInserts a new node at the beginning of the linked listInserts a new node at 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()

What will be the output of the following code?class Node:    def __init__(self, data=None):        self.data = data        self.next = Noneclass LinkedList:    def __init__(self):        self.head = None    def print_list(self):        current_node = self.head        while current_node:            print(current_node.data)            current_node = current_node.next    def insert_at_beginning(self, new_data):        new_node = Node(new_data)        new_node.next = self.head        self.head = new_nodellist = LinkedList()llist.insert_at_beginning(3)llist.insert_at_beginning(2)llist.insert_at_beginning(1)llist.print_list()Options1 2 31 3 22 3 13 2 1

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 head

What is the purpose of the append method in a linked list?Inserts 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 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