Known list node structure is as follows:

Typedef struct N

{

The int data;

Struct N * next;

} the Node;

The following function prototype in the head is the head pointer singly linked list, write a function to list to flip (such as 1, 3, 2, 4, into 4,2,3,1), and using the new first finally point address as the function return value,

Node * f (Node * head)

{