computer science. This function reverses a linked list. However I do not see it. If you have 1->2->3->NULL. Can you explain how this works?

I see that 1 is being passed. 1 does not equal NULL and 1's next does not equal NULL so then you do a recursive call and call 2. 2 is not null and its next is not null. So you do a recursive call calling in 3. 3's next equals NULL. So you return 3. Now rest = 3. I now see two lines impacting the list which will make the list look like 1->2->NULL->2 and it then returns rest (which is 3). We now recurse backwards but I am lost. I believe at some point I made a mistake. Can you please explain??

Given the linked list structure named node, defined in lines 1 through 4, and the function named eFunction defined in lines 6 through 14, answer the questions below. 1 typedef struct node { int data; struct node * next; 4 } node; MOOOOO 6 nodet e Function (node* a Node) { if (aNode == NULL) return NULL; if (aNode->next == NULL) return a Node; node* rest = eFunction (aNode->next); aNode->next->next = aNode; a Node->next = NULL; return rest; 13 14 }