What is the minimum number of divisions made by Euclid's algorithm among all inputs $1<=$ m$,$ n $<=10?$

Answer:

For any input pair m $>=$ n $>=1,$ in which m is a multiple of n$,$ Euclid$$s algorithm makes exactly one division; it is the smallest number possible for two positive numbers.

True$$or$$False