I have this algorithm that is really giving e a problem can someone please help me.

```
void Transpose (int a[][SIZE], int n)
}
for(int=1;i<n;i++)
for(int j=i+1; j<=n; j++)
{
int t=a[i][j];
a[i][j]=a[j][i];
a[j][i]=t
}
}
```

I need to obtain the time complexity of the above matrix transpose algorithm using program step count method.

Thanks for any help I can get on this.