$(5$ points$)$ Write an algorithmic pseudocode that reverses a singly

linked list in one pass of the list. The function accepts a pointer to

the beginning of the list, and returns a pointer to the beginning of

the reversed list. The function must not create any new nodes. You

should assume that each node has only a next pointer that points to

the next node in the list