in Python.

the input must be Linked List Not List. Linked List and k

class Node: def __init__(self, data=None, next_node=None): self.data = data self.next = next_node def __str__(self): return str(self.data) class LinkedList: def __init__(self): self.length = 0 self.head = None def print_list(self): node = self.head while node is not None: print(node, end=' ') node = node.next print('') def add_at_head(self, node): node.next = self.head self.head = node self.length += 1 def remove_node_after(self, node): if node.next is not None: temp = node.next node.next = node.next.next temp.next = None self.length -= 1 def remove_first_node(self): if self.head is None: return temp = self.head self.head = self.head.next temp.next = None self.length -= 1 def to_list(self): current = self.head l = [] while current is not None: l.append(current.data) current = current.next return l def create_linked_list(seq): ll = LinkedList() for x in reversed(seq): ll.add_at_head(Node(x)) return ll 

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]