Use DrRacket

A univariate polynomial of order n is given by the following equation. P_n (x) = a_nxⁿ + . . . + a₂x² + a₁x + a₀

Here, a_i are the coefficients of the polynomial, and x is its unique variable. You might implement a procedure poly-3 for computing the polynomial of order 3 of x as follows.

(define (poly-3 x a0 a1 a2 a3) (+ a0 (* a1 x) (* a2 x x) (* a3 x x x))) 

1. In poly-3, the coefficients and the variable are bundled together as arguments; and you would have to specify the coefficients each time you want to compute the same polynomial with different values of x. Instead, implement the procedure make-poly-3 that generates a procedure that computes the polynomial for an arbitrary x.

   (define (make-poly-3 a0 a1 a2 a3) ...) (define my-poly-3 (make-poly-3 1 2 3 4)) (my-poly-3 2) 

2. Next, write a function sum-poly-3-range which will sum up the results for calling my-poly-3 for the values in a range:

   (define (sum-poly-3-range from to) ...) (sum-poly-3-range 1 50)