Ononot — A recursive function f(n) defined by f(n) = f(n-1) + k where

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursioneasy

0:00.0

A recursive function $f(n)$ defined by $f(n) = f(n-1) + k$ where $k$ is a constant. If $f(3) = 10$ and $f(4) = 15$ , what is the value of $k$ ?