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 an n x n matrix M and computes its transpose. We assume that the first line starts at i=1 and the first column starts at j =1. Line # 2 performs [Select] comparisons and [ Select ] additions during the full execution of this algorithm. Let us call t; the number of times the statement "buffer = M[j][i]" is executed when i=j. t1 is equal to [ Select ] . t2 is equal to [ Select] tz is equal to [ Select ] . tn-1 is equal to [ Select ] tn is equal to [ Select ] Let the sum S be: S = {j=1 t; S is equal to [ Select] The sum S grows like [ Select ] transposeMatrixCM) 1: //Transpose a Matrix M 2: for i = 1 to n 3: for j = i to n 4: buffer - M[j][i] 5: M[j][i] M[i][j] 6: M[i][j] buffer 7: return = 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 an n x n matrix M and computes its transpose. We assume that the first line starts at i=1 and the first column starts at j =1. Line # 2 performs [Select] comparisons and [ Select ] additions during the full execution of this algorithm. Let us call t; the number of times the statement "buffer = M[j][i]" is executed when i=j. t1 is equal to [ Select ] . t2 is equal to [ Select] tz is equal to [ Select ] . tn-1 is equal to [ Select ] tn is equal to [ Select ] Let the sum S be: S = {j=1 t; S is equal to [ Select] The sum S grows like [ Select ] transposeMatrixCM) 1: //Transpose a Matrix M 2: for i = 1 to n 3: for j = i to n 4: buffer - M[j][i] 5: M[j][i] M[i][j] 6: M[i][j] buffer 7: return =