The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?struct node{  int value;  struct node *next;};void rearrange(struct node *list){  struct node *p, * q;  int temp;  if ((!list) || !list->next)      return;  p = list;  q = list->next;  while(q)  {     temp = p->value;     p->value = q->value;     q->value = temp;     p = q->next;     q = p?p->next:0;  }}1,2,3,4,5,6,72,1,4,3,6,5,72,3,4,5,6,7,11,3,2,5,4,7,6

What is the output of the following function for a single linked list with the values1 -> 2 -> 3 -> 4 -> 5-> 6? start is pointing to the first node in the list.void fun(struct node *start){if (start == NULL) return;printf(“%d”, start->data);if (start-> next != NULL){fun (start-> next -> next);printf(“%d”, start->data);}}

What will be the output of the following code snippet for the list 1->2->3->4->5->6?void solve(struct node* start){if(start == NULL)return;printf("%d ", start->data);if(start->next != NULL )solve(start->next->next);printf("%d ", start->data);}*2 points1 2 3 4 5 61 3 5 5 3 61 3 5 1 3 52 4 6 1 3 5

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

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

Write a function that searches a linked list for the integers that occur more than once, and removes all their occurrences except for the first occurrences. The function does not remove the integers that occur only once. Removed nodes must be freed. Each node is defined asstruct node{     int data;     struct node * next;};The function is declared as follows. Its input is the head pointer of the linked list. It returns the head pointer of the linked list after the removal.struct node *remove_repeated_integer(struct node *list);