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 = NoneDeletes the first occurrence of a node with the specified keyDeletes all nodes with the specified keyInserts a node with the specified key at the beginning of the linked listReverses the linked list

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

What one of the following algorithm depicts the correct logic to delete a node from the beginning of a list:1. Mark the first node in the list as current.2. Make START point to the next node in the sequence.3. Release the memory for the node marked as current.1. Mark the first node in the list as current.2. Make START point to the newNode in the sequence.3. Release the memory for the node marked as current.1. Mark the first node in the list as current.2. Make START point to the next node in the sequence.3. Release the memory for the node marked as next.1. Mark the first node in the list as newNode.2. Make START point to the next node in the sequence.3. Release the memory for the node marked as current

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