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;

Write a C program to reverse a single linked list recursively. #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node* next; }; // Write a function to create a new node with the given data // Write a function to print the linked list // Write a function to reverse the linked list recursively // Write your main function here

Which of the following methods is best for reversing a singly linked list in place (changing an existing list)?  *1 pointa) Using a stack to store the nodes and then rebuilding the listb) Using recursion to reverse the listc) Using an iterative approach with three pointers (prev, curr, next)d) Creating a new reversed list and copying the nodes from the original list

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

Write a C program to reverse a single linked list recursively. Sample Test Cases Test case 1 No·of·nodes:·5 Data·for·node·1:·5 Data·for·node·2:·4 Data·for·node·3:·3 Data·for·node·4:·2 Data·for·node·5:·1 Original·linked·list:·5·->·4·->·3·->·2·->·1·->·Null⏎ Reversed·linked·list:·1·->·2·->·3·->·4·->·5·->·Null⏎ Test case 2 No·of·nodes:·7 Data·for·node·1:·1 Data·for·node·2:·2 Data·for·node·3:·3 Data·for·node·4:·4 Data·for·node·5:·3 Data·for·node·6:·2 Data·for·node·7:·1 Original·linked·list:·1·->·2·->·3·->·4·->·3·->·2·->·1·->·Null⏎ Reversed·linked·list:·1·->·2·->·3·->·4·->·3·->·2·->·1·->·Null⏎

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.