PYTHON (Compute greatest common divisor using RECURSION) The gcd9m, n) can also be defined recursively as follows:

if m % n is 0, gcd(m, n) is n.

Otherwise, gcd(m, n) is gcd(n, m % n).

Write a RECURSIVE function to find the GCD. Write a test program that prompts the user to enter two integers and display their GCD.