Sort List - Read Statement

Given the head of a linked list, sort it in ascending order.

Follow up: Can you sort it in $O(n \log n)$ time and $O(1)$ space? Merge sort is ideal for linked lists since you don't need random access.