Consider the linked list bellow. Which loop display to us the five elements of the list : 85, 90, 42, 54, 76*3 pointsOption 1Option 2Option 3Option 4Other:

Given list [40, 70, 59, 58, 76, 20, 74, 62], what is the list after three iterations of the outer loop?

Given list [27, 73, 58, 44, 62, 51, 18], what is the list after three iterations of the outer loop?

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

6.Question 6A variable named my_list contains the list [1,2,3,4]. Which line of code adds the element 5 to the end of the list?1 pointmy_list.insert(4,5)my_list.insert(5,5)my_list.insert(5)my_list.insert(5,4)

Alternate Elements in Linked ListYou are now well versed with the concepts of Linked Lists. So, now you have been given an advance coding challenge, i.e., you have to create the code on the topic linked lists such that it will give the output of only elements in alternate position from last to first and then first to last. Constraints:Input Format :First line of input contains the number of integers.Next lines are followed by the integer values.Output Format :Corresponding output.Example:Input 1:51  2  3  4  5Output 1:1  3  55  3  1 Input 2:411  12  14  13Output 2:12   1313  12  Explanation:Alternate elements from first element are 1 3 5Alternate elements from last to first are 5 3 1Public Test Cases:# INPUT EXPECTED OUTPUT1 51 2 3 4 51 3 5 5 3 1 2 4 11 12 14 1311 14 13 12