discrete mathematics and

. These example suggest a general strategy for finding gcd(m, n): Replace m and n by n and m MOD n and try again. AlgorithmGCD(integer, integer) (lnput: m, n E N, not both 0.) Output: gcd(m, n).) Auxiliary variable: integers a and b. a:= m; b := n (The pairs (a, b) and (m, n) have the same ged.) while b0 do (a, b) := (b, a MOD b) return a Use the above to determine the following: m = 75, n = 12