Consider a recursive function f(n)={0if n=0f(⌊n/2⌋)+(n mod 2)if n>0f(n) = \begin{cases} 0 & \text{if } n = 0 \\ f(\lfloor n/2 \rfloor) + (n \bmod 2) & \text{if } n > 0 \end{cases}f(n)={0f(⌊n/2⌋)+(nmod2)if n=0if n>0. What is f(15)f(15)f(15)?
2
3
4
5