For any input pair m$,$ n such that $0<=$ m$<$ n$,$ Euclid$$s algorithm simply swaps the numbers on the $$rst iteration:

gcd$($m$,$ n$)=$ gcd$($n$,$ m$)$

Question $12$ options:

True

False