hi can you do number 5 for me? 1. Compute the following sums.a) 1+3+5+ 7 +...+ 999b) Σ412. Use the Euclid's algorithm to find gcd between 46415 and 131423. Write a pseudocode for an algorithm for finding real roots of equationax² + bx + c = 0 for arbitrary real coefficients a, b, and c. (You may assumethe availability of the square root function sqrt(x).)4. Describe the algorithm used by your favorite ATM machine in dispensing cash.Give your description in a pseudocode.5. Analyse the following algorithm,ALGORITHM Unique Elements (A[0..n-1])//Determines whether all the elements in a given array are distinct//Input: An array A[0..n-1]//Output: Returns "true" if all the elements in A are distinctand "false" otherwise11for i0 to n - 2 dofor ji+1 to n - 1 doif A[i] = A[] return falsereturn true

The solution is given below for the above-given question:

5. Analyse the following algorithm, ALGORITHM Unique Elements (A[0..n-1]) //Determines whether all the elements in a given array are distinct //Input: An array A[0..n - 1] //Output: Returns "true" if all the elements in A are distinct and "false" otherwise 11 for i 0 to n - 2 do for ji+1 to n - 1 do if A[i] = A[j] return false return true