Given a Linked list of size N, the list is in alternating ascending and descending orders. Your task is to complete the function sort() that sorts the given linked list in non-decreasing order.

Example 1:

Input:
LinkedList: 1->9->2->8->3->7
Output: 1 2 3 7 8 9
Explanation: After sorting the given
linked list, the list will be as
1-> 2-> 3-> 7-> 8-> 9.

Example 2:

Input:
LinkedList: 13->99->21->80->50
Output: 13 21 50 80 99

Your Task:
The task is to complete the function sort() which should sort the linked list in non-decreasing order. The sorted linked list is printed by the driver's code.

Note: Complete the task in constanst auxilliary space.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 <= Number of nodes <= 100
0 <= Values of the linked list <= 10³