in Python.

Knowing that the input is a Linked List l and an integer k and the space complexity is O(k)

Problem 3 - Cutoff Ladder Sort Write a function cutoff_sort(1, k) that takes a LinkedList of numbers, and an integer k and individually sorts every range of k values inplace (re-use the same nodes). Your solution should be O(k) in terms of space. For example: 1l1 = LinkedList( [4, 3, 15, 1, 15, 2]) cutoff_sort(11, 3) 111.print() # outputs: [3, 4, 15, 1, 2, 15] #sorted ranges has the range: (0-2), (3, 5) 112 = LinkedList([15, 3, 25, 4, 18, 2, 8]) cutoff_sort(112, 2) 112.print() # outputs: 13, 15, 4, 25, 2, 18, 8]