Given the head of a singly linked list, sort the list using insertion sort and return the head of the sorted list.

Constraints:

• The number of nodes in the list is in the range $[1, 5000]$.

• $-5000 \leq$ Node.val $\leq 5000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.