om in Exercise 2 (60 points) Analyze transpose algorithm Consider the problem to compute the transpose AT of an nxn matrix A. Consider the pseudocode to compute the transpose of an n x n matrix A transposeMatrix (A) 1: for i = 1 to n for i = 1 to j - 1 // swap A[i][j] and buffer = A[i][j] A[i][j] = A[j][i] A[j][i] = buffer All the questions in this exercise are related to the transposeMatrix(A) algorithm. The objective of this exercise is to explore whether the time complexity will change if we count different "actions" B) (16 points) Assignment Action In this case, we count the number of assignments performed by Lines 4-6. Answer the following questions to determine the total number of assignments performed by the algorithm transposeMatrix(A). a. Let us call aj the number of assignments performed by Lines 4-6 for a given value of j. Fill in this table: n-1 b. Express the function fa(n) that represents the overall total number of assignments performed by Lines 4-6 during the execution of transposeMatrix(A). C. The function fa(n) grows like which function