I need this in C programing

And please give me complete code with screenshot of your output.

4. List reversal (20 points). Implement the function reverse) in reverse.c. The prototype of the function is: node reverse (node head) As above, the function receives as its sole argument a pointer to the singly linked list. This time the list is assumed to be acyclic. The function the "next" links of the nodes so that the nodes end up linked in reverse order. The function must return the address of the new head node (originally last in the list). You may use additional functions and local variables besides those already included in the provided template, but cannot change the values stored in the nodes or dynamically allocate new nodes. head node of a must change veral test cases (including both eyclic and acyclic lists) are hard coded in the main ion of reverse.c. After completing the implementation of the two functions compiling and running the reverse program should print the following output % -/reverse reverse: 3-2-1- reverse reverse: 0-1-2-3 reverse: 10-9-8-7-6-5-4 reverse reverse: 4-5-7-8-9-10 reverse: 17-16->15-14-13-12-11 reverse reverse: 11-12-13-14-15-16->17 reverse: 18 reverse reverse: 18 reverse: 23-22-21-20-19 reverse reverse: 19-20-21-22->23 reverse: reverse reverse