algorithms

(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. (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