The question requires knowledge of data structures and algorithms.

- Use big o notation to explain time complexity.

- Show details with explanations.

(a) Interpret the result of executing the function below. Explain why. (5 marks) (b) Analyse the time complexity of my_algo. (5 marks) (c) If the elements in the array are already sorted by row and by column. Implement an improved algorithm in Question 2(a) so that the time complexity can be optimized to O(n)