Exercise 0.2.9 (Extended Euclidean Algorithm)

Write a computer program to determine the greatest common divisor $(a,b)$ of two integers $a$ and $b$ and to express $(a,b)$ in the form $\mathit{𝑎𝑥}+\mathit{𝑏𝑦}$ for some integers $x$ and $y$.