Youre given an array A[1 n] of n numbers, and would like to know if the array includes two equal numbers. Describe an algorithm that does this job for you. The running time must be O(n log n).

advanced) You re given an array A of n numbers, and wo array includes two equal numbers. Describe an algorithm that does this job for you. The running time must be O(n log n). 10. (advanced) were given three sorted arrays A[1 r], B[1 y], C[1 2]. Describe an algorithm that merges the given three sorted (in increasing order) arrays into one (sorted array). What is the running time