Polynomial Modulo Function in Scheme
Language for code: Scheme <---must be this language function delcaration: (poly_mod apol bpol)
Input: lists which enumerate coefcients of polynomials, starting from the constant term.
for example the polynomial 6x^2 + 3x + 1 would be input as list( 1 3 6)
Output: list would be similar out put to the above example ( 1 )
Rules:
1. Assume all numbers are integers
2. You should only use the pure functional features of Scheme.
3. The leading coeffcient of the output polynomial can not be zero. If the result is the zero polynomial, please output the empty list.
4. You may assume that input polynomials have integer coeffcients. The output polynomial for the modulo operation may have coeffcients that are rational numbers.
5. For poly mod, you may assume that bpol is not zero.