Let a = 5200 and b = 1320.
(a) If a is the dividend and b is the divisor, determine the quotient q and remainder r.
(b) Use the Euclidean Algorithm to find gcd(a; b).
(c) Use your work in part (b) to write gcd(a; b) as a linear combination of a and b.
(d) Give the prime factorization of each of a and b.
(e) Use your answer to part (d) to find gcd(a; b) and lcm(a; b).