21) Using Euclid's recursive greatest common divisor formula, find the greatest common divisor of 248 and 156. Show all steps as shown in the example below to receive full credit.

Example:

Use Euclid's formula - gcd/a,b) ged(b, a mod b) to find the gcd of 24 and 68 Method 1 Method 2 gcd(68,24) = gcd(68, 24 mod 68) = gcd(68,24) = gcd(24, 68 mod 24) = gcd(24, 20) = gcd(24, 68 mod 24) = gcd(24, 20) = gcd(20, 24 mod 20) = gcd(20, 4) = gcd (4, 20 mod 4) =gcd(4,0) gcd(24, 68) gcd (20, 24 mod 20) Cd( 20, 4) = gcd(4, 20 mod 4) = gcd(4,0) | gcd(24, 68) = 4