**Language is R5RS (SCHEME)**

1. Abstracting the summation of a series (a) Consider the harmonic numbers H,-- + + + . Last week you wrote a recursive ScHEME function (named harmonic) which, given a number n, computes H Revise your harmonic function, keeping the name (harmonic n), to take advantage of the sum function seen in the textbook (Sectiorn 1.3.1) and shown below: (define (sum term a next b) (if (> a b) 0 (+ (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. (b) The above definition of sum is a recursive process. Write an iterative version sum-i that solves the same problems as sum in an iterative fashion. Demonstrate that it works by using it to define harmonic-i. (c) Show that your harmonic functions work for 1, 50, and 100. 1. Abstracting the summation of a series (a) Consider the harmonic numbers H,-- + + + . Last week you wrote a recursive ScHEME function (named harmonic) which, given a number n, computes H Revise your harmonic function, keeping the name (harmonic n), to take advantage of the sum function seen in the textbook (Sectiorn 1.3.1) and shown below: (define (sum term a next b) (if (> a b) 0 (+ (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. (b) The above definition of sum is a recursive process. Write an iterative version sum-i that solves the same problems as sum in an iterative fashion. Demonstrate that it works by using it to define harmonic-i. (c) Show that your harmonic functions work for 1, 50, and 100