What's the time complexity of the following function $($assuming n $<=$ m $)?$def foo$($m$,$ n$)$: gcd $=1$ k $=2$ while k $<=$ m and k $<=$ n : if m $\%$ k $==0$ and n $\%$ k $==0$:gcd $=$ k k $+=1$ return gcd