Part A. (Wawns) In the 2nd midterm, we asked you to help Yingying and Howie to write function delete for a singly-linked list using the following node structure: typedef struct node_t f int32_t value; node_t* next; I node_t; Now Howie wants you to re-implement the function delete using RECURSION. Complete the function delete below USING ONLY ONE LOCAL VARIABLE. Only the FIRST TWELVE LINES of code will be graded (not counting lines with only curly braces). Only EIGHT lines are necessary to solve this problem. Hint: Do not forget to free the deleted data structures. *****ANSWERS USING MORE THAN ONE LOCAL VARIABLE WILL EARN 0 POINTS. ****