Page of Prob. 3. Recursion The expression m%n yields the remainder of m upon division by n. Note: % ls the modulus operator. The result of x % y Is the remainder after the integer division of integer x by nonzero integer y Define the greatest common divisor (GCD) of two integers and y by gcd ( x, gcd ( x, gcd (x, y) y) y) if (y