Using Python!!!

Write a recursive function gcd(m,n) that returns the greatest common divisor of a pair of numbers. The gcd of m and n is the largest number that divides both m and n. If one of the numbers is 0, then the gcd is the other number. If m is greater than or equal to n, then the gcd of m and n is the same as the gcd of n and m-n. If n is greater than m, then the gcd is the same as the gcd of m and n-m.

>>> gcd(5,0)

5

>>> gcd(15,5)

5

>>> gcd(5,7)

1

>>> gcd(24,144)

24

>>> gcd(124,144)

4