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 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 linked list

28. What is the purpose of the append() method in Python lists? A) To insert an element at a specific position in the list B) To remove the first occurrence of an element from the list C) To add an element to the end of the list D) To reverse the order of the elements in the list 29. Which of the following is the correct way to access the last element of a list in Python? A) list[-1] B) list[0] C) list[len(list)] D) list[1] 30. What is the main difference between a list and a tuple in Python? A) A list is mutable while a tuple is immutable B) A tuple is mutable while a list is immutable C) A list can contain elements of different data types while a tuple can only contain elements of the same data type D) A tuple can contain elements of different data types while a list can only contain elements of the same data type

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.

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()