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

How can you efficiently reverse the order of the elements in a singly linked list? Iterate through the list and swap elements in pairs. Create a new list and add elements in reverse order. Use recursion to recursively reverse sub-lists. Reverse the pointers of each node in the list.

Given a head to Linked List L, write a function to reverse the list taking k elements at a time. Assume k is a factor of the size of List.You need not have to create a new list. Just reverse the old one using head.

The 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.*head_ref = prev;*head_ref = current;*head_ref = next;head_ref = NULL;

A linked list whose last node points back to both the head node and the previous node instead of containing the null pointer ____________