Sort a Linked List using Merge Sort

Approach Explanation o((^▽^))o

1. If the list is empty or has one node, it’s already sorted.
2. Use slow/fast pointers to split the list into two halves.
3. Apply merge sort on each half.
4. Combine two sorted halves into one sorted list.