(C ONLY)

Singly-Linked Lists and recursion: Write a recursive function named modify to replace each node's value with the sum of the current node's value and all of the subsequent nodes' original values. For example, if the linked list is 1-->-->20-->30 the final values will be 53-->52-->50-->30