(b) You are given the following algorithm which accepts as input an nn square matrix A and we need to compute C=A2=AA where A[i,j] is the element in row i and column j. 1: procedure MATRIXSQUARED (A,n) 2:3:4:5:6:7:8:9:10:fori=1tondoforj=1tondofork=1tondoC[i,j]=C[i,j]+(A[i,k]A[k,j])endforendforendforreturnTRUEendprocedure (i) (1 point) 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. (iii) (1 point) Write your answer for part(ii) using -notation (c) Consider the following algorithm for computing the factorial of some integer n2. 1: procedure FACTORIAL (n) 2:3:4:5:6:7:8:9:i=1j=1whilej