Estimate in terms of n, the worst case time complexity of each of the following pseudo-code snippets: a. ALGORITHM sum(n) sumo for it to n do for jo to n*n do sum sum + 1 return sum b. 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 for i = 0 to n - 2 do for j - i +1 to n - 1 do if A[i]=A[j] return false return true