The question requires knowledge of Data Structures and Algorithms.

- For part (b), explain based on big O notation and time complexity.

- For part (c), explain based on recursive algorithms.

- Any code required is to be done in Python.

- Please provide detailed and clear explanations. Thanks!

(a) Interpret the result of executing the function below. Explain why. def my_algo (x,n): if n=0: return 1 else: return x my_algo (x,n1) print ( my_algo 2(2,5)) (5 marks) (b) Analyse the time complexity of my_algo. (5 marks) (c) Show the recursion trace for the computation of power (2,5), using the function implemented in Question 2(a)