The following C Function takes a singly- linked list of integers as a parameter and rearranges the elements of the lists. 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 functio completes execution? struct nodef int value struct node* next; void rearrange (struct node* list) struct node *p,q int temp; if ListII list->next) return; p->list; q=list->next; while (q) temp=p->value; p->value=q->value ; g-value temp:p-next I-P?P-next:0 a) 1, 2, 3, 4, 5, 6, 7 c) 1, 3, 2, 5, 4, 7, 6 b) 2,1,4, 3, 6, 5,7 d) 2, 3, 4, 5, 6,7,1 Write an algorithm to insert a value in double link list Create a new nodo & addiess in Check [ov osflow , evoitouPma louu and