Problem 1: Use Euclid's algorithm to find gcd(34,21) and then to find integers m and n such that gcd(34,21) = m34+n21.

Problem 2: Use Euclid's algorithm to find gcd(385,168) and then to find integers m and n such that gcd(385,168) = m385+n168.