The pseudo$-$code below that finds the sum of numbers in an n$-$row n$-$column numeric table M$.$ Select the one correctly describes the time complexity of the algorithm.

total :$=0$

For i $=1$ to n

For j $=1$ to n

total :$=$ total $+$ M$($i$,$ j$)$

End$-$for

End$-$for