The greatest common divisor (gcd) of two positive integers m and n can be defined recursively as follows:

• if m % n == 0 , gcd(m, n) = n

• otherwise: gcd(m, n) = gcd(n, m % n)

The function signature is:

def gcd(m, n): """ ------------------------------------------------------- Recursively find the Greatest Common Denominator of two numbers. Use: ans = gcd(m, n) ------------------------------------------------------- Parameters: n - an integer (int) m - an integer (int) Returns: ans - the function result (int) ------------------------------------------------------- """