Given this node structure:

struct Node $\{$ int data; struct Node$*$ next; $\}$;

What happens if we execute free$($current$)$ without first preserving current$->$next?

Nothing; the rest of the list remains accessible

The next node becomes the head of the list

The memory is freed, but the link is preserved

The rest of the list becomes inaccessible, causing a memory leak