Ononot — A recursive function is defined as f(n) = f(n-1) + 2n for n

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

Recursionmedium

0:00.0

A recursive function is defined as $f(n) = f(n-1) + 2n$ for $n > 0$ and $f(0) = 0$ . Which closed-form expression matches this?