Question 1 50 pts Select from multiple dropdowns. 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 nxn matrix A and B and computes their product C=A*B. We assume that the first line starts at i=1 and the first column starts atj=1. For any matrix M, we designate M(ij) the element on the ith line and ith column. In total, this algorithm performs the statement S = 0 (Line #4) [Select ] times. In total, this algorithm performs the addition in Line #6 [Select] times. In total, this algorithm performs the multiplication in Line # 6 (Select] times. The total number of additions (Line #6) grows as (Select] . The total number of multiplications (Line #6) grows as [Select] The total number of additions and multiplications performed in Line # 6 is (Select] The total number of additions and multiplications performed in Line #6 grows as (Select] 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 = 0 5: for k=1 to n 6: S = S + Ali,k) * B(k,j) 7: C(ij) = 5 8: return