You won't need the info from problem 2 to complete this. here's the link mentioned https://github.com/apanangadan/CSUF-CPSC_131 . will thumbs up

#3 [4 points] Given a singly linked list as in Problem 2, write a recursive function to re-orient the the next pointers of all the nodes in a list to each point to the previous element. Use the code available from SLinkedList.h on our Github https://github.com/apanangadan/CSUF-CPSC 131 with modification to illustrate your approach. For the example given in Problem 2, the linked list will look like: Wan | 61.4 | Rocio | 93.2 | Rick | 90.1 1 Dan | 79.11Ann | 67.0 #3 [4 points] Given a singly linked list as in Problem 2, write a recursive function to re-orient the the next pointers of all the nodes in a list to each point to the previous element. Use the code available from SLinkedList.h on our Github https://github.com/apanangadan/CSUF-CPSC 131 with modification to illustrate your approach. For the example given in Problem 2, the linked list will look like: Wan | 61.4 | Rocio | 93.2 | Rick | 90.1 1 Dan | 79.11Ann | 67.0