The question requires knowledge of Data Structures and Algorithms. Any code required is to be done in Python.

- For part (c) based on big O notation and time complexity.

- Please provide detailed and clear explanations.

(a) Let A be an array of size n2 which contains integers from 1 to n1, inclusive, with exactly one repeated. Implement an efficient algorithm in Python for finding repeated integer in A. (5 marks) (b) Discuss your solution if more than one integer is repeated in Question 6(a). (3 marks) (c) Analyse the time complexity of the function in Question 6(a). (2 marks)