Ononot — A recursive algorithm is defined: f(n) = \begin{cases} 0 & \

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

Recursionmedium

0:00.0

A recursive algorithm is defined: $f(n) = \begin{cases} 0 & \text{if } n \leq 0 \\ f(n-1) + n & \text{if } n > 0 \end{cases}$ . What is the maximum recursion depth (total active stack frames, including the deepest call) when calling $f(50)$ ?