Answer Happy

I hope you solve all the points with the right answers and with
Screenshot please,
Question 4: (10 Marks) Given a list of integers of size N that contains integers between 1 and N-1 with the possibility of duplication, design an algorithm to find such duplicated number in the array using the most efficient method (6 marks) and analyse its complexity (4 marks). For example: Input: {1, 2, 3, 4,4} Output: the duplicate element is 4 Input: {1, 2, 3, 4, 2} Output: the duplicate element is 2