The question requires knowledge of data structures and algorithms.

- Use big o notation to explain time complexity.

- Show details with explanations.

(a) Implement a function remove_all(data, value) in Python that removes all occurrences of value from the given data which is a Python list, such that the worst-case running time of the function is O(n) on a list with n elements. (5 marks) (b) Analyse why your implementation has a worst-case running time of O(n)