Solve:

Examples of Euclids algorithm and the extended Euclidean algorithm:

(a) Find d = gcd(423, 128). Are they co-prime? Now find integers x, y, such that d = x 423 + y 128.

(b) Find d = gcd(588, 210). Are they co-prime? Now find integers x, y, such that d = x 588 + y 210.

(c) Find d = gcd(420, 96). Are they co-prime? Now find integers x, y, such that d = x420+y 96.

(d) Find d = gcd(33, 27). Are they co-prime? Now find integers x, y, such that d = x 33 + y 27.