Leta 315, 6-825.
(a) Use the Euclidean algorithm to find the greatest common divisor of the pair of integers a, b.
(b) Find integers s and t such that sa + tb=gcd(a,b)