2. Use the Euclidean Algorithm to obtain integers x and y satisfying the following: (a) gcd(56,72) 56x + 72y. (b) gcd(24, 138) = 24x + 138y. (c) gcd(119,272) = 119x+272y. (d) gcd(1769, 2378) = 1769x+2378y.

When we divide a polynomial P(x) by a divisor D(x), the Division Algorithm tells us that we can always obtain a quotient Q(x) and a remainder R(x). State two forms in which the result of this division can be written.