please solve in c++

1. (5 points) Given an array and a singly linked list. Which of these data structure uses more memory space to store the same number of elements? Explain your answer (5 points) Given a singly linked list where each node has one reference (next) which points to a next node: 2. isr 2 ptri Assuming the linked list above, provide the output for the following code fragments. The list is restored to its initial state before each line executes: a) b)- c) listData->next->next->next->info; ptri-mext-mext->next->info ; listData->next->next->info8: 3. (5 points) Examine the following code segment int fun (int n) if (n0) return 1 i else return n+ fun (n/2) If the function is called as : cout