What does the following linked list function do at a high level?

Node $*$ fun$($Node $*$ head$)\{$

if $($head $==$ NULL$)$ return NULL;

if $($head$->$next $==$ NULL$)$ return head;

Node $*$ tmp $=$ head$->$next;

Node $*$ tmp$2=$ fun$($head$->$next$)$;

tmp$->$next $=$ head;

head$->$next $=$ NULL;

return tmp$2$;

$\}$

What does the following linked list function do at a high level?

Node $*$ fun$($Node $*$ head$)\{$

if $($head $==$ NULL$)$ return NULL;

if $($head$->$next $==$ NULL$)$ return head;

Node $*$ tmp $=$ head$->$next;

Node $*$ tmp$2=$ fun$($head$->$next$)$;

tmp$->$next $=$ head;

head$->$next $=$ NULL;

return tmp$2$;

$\}$

Deletes all nodes in the list

Reverses a linked list

Swap adjacent pairs of nodes

Moves the first value of the list to the back. All other values stay in their respective order.

Moves the last value of the list to the front. All other values stay in their respective order.

None of the above.