QUESTION 2 (20 Points) Write a function which takes a singly linked list (as NODE pointer) and modifies the entries so that: Each entry is replaced by the sum of itself and all entries after it in the list (as initially given) Note the last element will be unchanged because it has zero elements following it Example BEFORE: AFTER: Details/Hint/Runtime: * Your function does NOT create a new list. It simply modifies the values in the given list. . Remember the function is at the "NODE Level" -- no 'wrapper' with front/back, etc. Rule NO ARRAYS ALLOWED Rule NO CALLS TO mallod . Runtime: for full credit, your function should have O(n) runtime. Hint: recursion typedef struct node int vali struct node *next NODE; // your function here