SCHEME LANGUAGE

1. Given the next mathematical expression, write a recursive Scheme procedure to compute its first six terms. J(N) = if n= 1 f(n 1) * f(n-1) + 2n +1 otherwise