What is the time complexity of the following C language function, which assumes that

matrix$[][]$ is an nxn matrix.

int addMatrix$($int $**$ matrix, int n$)$

$\{$

int sum $=0$;

int k;

for $($k $=2$; k $$ n; k$=$k$*$k$)\{$

sum $=$ sum $+$ k;

$\}$

for $($int m $=1$; m$*$m $$ k; m$=$m$+1)\{$

for $($int r $=0$; r $$ n; r $=$ r$+$m$)\{$

sum $+=$ r;

$\}$

$\}$

$\}$