11. The extended Euclid's algorithm determines not only the greatest common

divisor d of two positive integers m and n but also integers (not necessarily

positive) x and y, such that mx + ny = d.

a. Look up a description of the extended Euclid's algorithm (see, e.g., [KnuI,

p. 13]) and implement it in the language of your choice.