Algorithm Analysis. (20 points) In this question you will need to analyze three algo-ithms and prove the required correctness and/or running time properties. (a) You are given the following algorithm which accepts as input a list of positive integers A=(a1,,an) and we need to determine whether all elements are unique (that is, there are no repeated elements in the list). If all elements are unique, the algorithm outputs True, otherwise it will output False. 1:2:3:4:5:6:7:8:9:10:procedureCHECKUNIQUE(A,n)fori=1ton1doforj=i+1tondoifai=ajthenreturnFALSEendifendforendforreturnTRUEendprocedure (i) ( 2 points) State the primitive operations and the data structure(s) to be used in this algorithm. (ii) (4 points) Compute the worst-case running time T(n) to output the final result. Write your answer exactly, without using asymptotic notation