2. (2 points) Determine the complexity of the following piece of code, which transposes an n x n matrix. (Give the summation and the result) for (i = 0; i < n = 1; i++) for(j=i+1; j < n; j++) { tmp =a[i][j]; a[i][j] = a[j] [i]; a[j][i] = tmp; }