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.

Let us call t_j the number of times the statement "buffer = M[j][i]" is executed when i=j.

t₁ is equal to?

Options:

1. n + 1

2. n - 1

3. n

4. n - j

transposeMatrix(M) 1: //Transpose a Matrix M 2: for i 1 to n 3: for j-i ton bufferML]Ci] 4: 5: 6: 7: return M[i] [j] buffer