4. (8 points) Write a recursive C++: function that will print the data from a linked list to standard output in reverse order given the following specifications: The list is singly-linked and each node has the following structure struct Node int data Node link A pointer to the head node provides the handle to the list, and this pointer contains the mull address if the list is empty. . For a non-empty list, the link field of the last node contains the mull address. NOTE: -The function should not change the given linked list in any way -The function should not create any temporary/working copies of the lin The function should not use any looping constructs (for, while, do-while). 8 poinsy Sh partitioning) of a Quicksort to own below is an array that results from completing the first stage G.e, the first split or lements in non-decreasing order (NOTE: The pivot element sort the e has been placed at the appropriate final position for this stage). Which of the elements been the pivot element used for the stage? ote: There may be more than one possibility and your answer should include all the possibilities (ie, circle each and every element that possibly could have been the pivot element used). ion: There will be penalty for each and every element circled that cannot possibly be the pivot element used. 0, 4, 3, 2, 5, 6, 8, 7, 9