Examine the following pseudocode. Each line is numbered (leftmost number). The objective of this exercise is to determine the time complexity of this algorithm that takes as input two n x n matrix A and B and computes their product ... We assume that the first line starts at i-1 and the first column starts at j -1 For any matrix M, we designate MJ) the element on the ith line and jth column. In total, this algorithm performs the statement S-O (Line # 4) [ Select ] # 6 | [ Select] multiplication in Line # 6 | [ Select] additions (Line #6) grows as | [ Select] multiplications (Line #6) grows as | [ Select] additions and multiplications performed in Line # 6 is Select] total number of additions and multiplications performed in Line # 6 grows as times. In total, this algorithm performs the addition in Line times. In total, this algorithm performs the times. The total number of . The total number of .The total number of .The I Select ] To determine the time complexity, the action to consider should be [Select matrixProduct (A, B) 1: //computes C-A.B 2: for i-1 ton 3: for j-1 to n 4: S= 5: for k-1 to n 6: S S + A(,k) 6(k,j)