Write in SCHEME

1. Abstracting the summation of a series Consider the harmonic numbers Hn = 1 + + } + ... + 1. Last week you wrote a recursive SCHEME function (named harmonic) which, given a number n, computes Hn. Revise your harmonic function, keeping the name (harmonic n), to take advantage of the sum function seen in the textbook (Section 1.3.1) and shown below: (define (sum term a next b) (if (> a b) (+ (term a) (sum term (next a) next b)))) Of course, your new and improved definition of harmonic should not be recursive itself and should rely on sum to do the hard work. 2. Abstracting the product of a series (a) The function sum in Question 1 is an abstraction of the sigma notation for summation: b {f(n) = f(a) +...+f(b) n=a Write a function (product term a next b) that abstracts the pi notation for the product of a series. You should name your function (product term a next b). b || f(n) = f(a) X...x f(b) n=a