Write a function that reverses a linked list, with this argument: pointer to pointer to the head node. — void reverse(node_t **head) { node_t *prev = NULL; node_t *current = *head; node_t *next = *head; while (current) { next = current->next; current->next = prev; prev = current; current = next; } *head = prev; }