Let A(x) and B(x) be polynomials (with coefficients in R). We say that ged(A(x), B(x)) = D(x) if D(x) divides A(x) and B(x), and if every polynomial C(x) that divides both A(x) and B(x) also divides D(x). For example, gcd((x - 1)(x + 1), (x - 1)(x+2)) = x – 1. Notice this is the exact same as the normal definition of GCD, just extended to polynomials.

Incidentally, gcd(A(x),B(x)) is the highest degree polynomial that divides both A(x) and B(x). In the subproblems below, you may assume you already have a subroutine divide(P(x),S(x)) for dividing two polynomials, which returns a tuple (Q(x),R(x)) of the quotient and the remainder, respectively, of dividing P(x) by S(x). (a) Write a recursive program to compute gcd(A(x),B(x))

Write a recursive program to compute god(A(x), B(x)).