Prove that for any positive integers a and b, if ax + by = z where x, y, and z are integers, then gcd(a, b) given z.
A) Use the Euclidean Algorithm.
B) Apply Bezout's Identity.
C) Utilize the Chinese Remainder Theorem.
D) Employ the Division Algorithm.
