SOLVED: Use the Euclidean Algorithm shown to compute the greatest common divisor of the pairs of numbers given in parts (a) and (b).Algorithm 1: Euclid's Algorithmprocedure EUCLID(a, b) T ← a mod b while r ≠ 0 do a ← b b ← r T ← a mod b end while return b go to % 10;end procedure(a)gcd(143, 99)(b)gcd(16, 9)(c)Determine integers x and y that satisfy the "Diophantine equation:16x 9y = gcd(16, 9)

Find GCF or GCD using the Euclidean Algorithm (solutions, examples, videos, worksheets, games, activities)