Write a scheme function called "sum" which takes an input function func and a nonnegative number n and outputs the value

func(1) + func(2) + .. + func(n)

function sum(number) {

      if (number == 1) {

             return 1;

      }

      return number + sum(number -1);

}

Explanation:

This is a recursive function, it means that is a function that calls itself for example: if you call the function with sum(5) the process is :

sum(5)

   | 5 + sum(4)

                           | 4 + sum(3)

                                                       | 3 + sum(2)

                                                                                   |2 + sum(1)

                                                                                                        | 1

the result is 1+2+3+4+5 = 15