Problem -A function f is defined by the rule that f(n) = n if n < 3 and f(n) = f(n-1) + 2 * f(n-2) + 3 * f(n-3) if n >= 3. Write a procedure that computes f by means of a recursive process. Write a procedure that computes f

SICP Exercise 1.6 is very interesting. I found it difficult to understand the problem and then the solution. It was fun to actually understand and reason about the solution. In section 1.1.7 we define a function to calculate square root of a number by Newton’s method

Define a procedure that takes three numbers as arguments and returns the sum of squares of the two larger numbersI broke this problem into 3 steps Define a square function which will take one argument and return its square. (define (square x) (* x x)) ; (square 6) 36 Define a sum-of-squares