Answer Happy

a) Suppose we have a singly-linked list containing n distinct integers, and some [5 marks] integer x. 1: def FOO(node, x) 2: if node 3: 4: 5: in öR ∞ 6: 7: 8: - head then return 0 result 0 if node.element <x then predecessor of node result + node.element + FOO(previous) previous result return result
a) Suppose we have a singly-linked list containing n distinct integers, and some [5 marks] integer x. 1: def FOO(node, x) 2: 3: 4: 5: 6: if node head then return 0 result 0 if node.element<x then previous result 7: 8: return result predecessor of node result + node.element + FOO(previous) Analyze the time complexity of running Foo from the last node of the list.