this is all we were given in the form of a node class you can make use of any of these:

A node implementation is provided. Your code can make use of any of the Node ADT methods: Node(), get_data(), set_data(), get_next(), set_next(), and get_sum().

Define a function called get_consecutive_sum_string_lengths(first_node) function which takes a Node object (a reference to a linked chain of nodes) as a parameter and returns a list of consecutive sums of the string lengths in this linked chain. For example, if the chain of nodes is: 'hello' -> 'to' -> 'programming', the result list will be [18, 13, 11]. Hence, the values are: 5 + 2 + 11 = 18 2 + 11 = 13 . 11 Note: you can assume that the Node class is given and the parameter is a valid Node object and all nodes contain string elements only. You can also assume that the get_sum_string_lengths() method in the Node class is available. For example: Test Result hello to programming [18, 13, 11] node1 = Node('programming') node2 = Node('to', nodel) node3 = Node('hello', node2) print_node_chain(node3) print(get_consecutive_sum_string_lengths (node3)) nodel = Node('great') node2 = Node('fun', nodel) node3 = Node( 'happy', node2) node4 = Node('sad', node3) print(get_consecutive_sum_string_lengths (node)) [16, 13, 8, 5] Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) 1 def get_consecutive_sum_string_lengths(first_node): 2 # IN PYTHON 3 | 4