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_end(self, new_data):    new_node = Node(new_data)    if self.head is None:      self.head = new_node      return    last_node = self.head    while last_node.next:      last_node = last_node.next    last_node.next = new_nodellist = LinkedList()llist.insert_at_end(1)llist.insert_at_end(2)llist.insert_at_end(3)llist.print_list()Options321132123213

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_node

What does the following Python code snippet accomplish?class Node:    def __init__(self, data):        self.data = data        self.next = Nonenode1 = Node(1)node2 = Node(2)node1.next = node2Creates two linked list nodes with data 1 and 2, respectivelyCreates a singly linked list with two nodes containing data 1 and 2, respectivelyCreates a doubly linked list with two nodes containing data 1 and 2, respectivelyRaises a syntax error

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 output of the following code snippet?class Node:    def __init__(self, value):        self.data = value        self.left = None        self.right = Nonedef count_leaves(node):    if node is None:        return 0    if node.left is None and node.right is None:        return 1    return count_leaves(node.left) + count_leaves(node.right)# Usage example:root = Node(1)root.left = Node(2)root.right = Node(3)root.left.left = Node(4)root.left.right = Node(5)root.right.left = Node(6)print(count_leaves(root))Options1234

what is the output of following python code? class myclass:    def __init__(self,a):        self.a = a        print(self.a)o=myclass()