Reverse Linked List

Given the head of a singly linked list, reverse the list and return the reversed list.

Example: 1→2→3→4→5 → 5→4→3→2→1

Follow up: implement both iteratively and recursively.