Given the head of a linked list, the nodes in it are assigned to each group in a sequential manner. The length of these groups follows the sequence of natural numbers. Natural numbers are positive whole numbers denoted by $(1,2,3,4...)$.

In other words:

• The $1^{st}$ node is assigned to the first group.

• The $2^{nd}$ and $3^{rd}$ nodes are assigned to the second group.

• The $4^{th}$, $5^{th}$, and $6^{th}$ nodes are assigned to the third group, and so on.

Your task is to reverse the nodes in each group with an even number of nodes and return the head of the modified linked list.

Note: The length of the last group may be less than or equal to 1 + the length of the second to the last group.

Constraints:

You can understand the problem a little better with the help of the illustration below:

Implement your solution in the following coding playground.