Language: Racket (R5RS):

Part 1: Write a higher-order procedure called product analogous to the provided sum procedure. The solution should generate a recursive process.

 (define (sum a b term next) (if (> a b) 0 (+ (term a) (sum (next a) b term next))))

Part 2: Rewrite your solution to Part 1 using an iterative process. An example of an iterative process:

 (define (factorial n) (define (factorial-iteration product counter) (if (> counter n) product (factorial-iteration (* counter product) (+ counter 1)))) (factorial-iteration 1 1))

Part 3: Use your solution to Part 1 or Part 2 to produce the given PI notations: