The question requires knowledge of Data Structures and Algorithms.

- If coding is required, use Python Programming.

- part (c) requires the use of Big O notation to explain.

(a) Describe what Fibonacci sequence is. (3 marks) (b) Given a task of computing Fibonacci numbers, solve it by completing the basic recursive algorithm below in Python. def fibonacci(n): if n