Consider the recursive function: f(n) = f(n-1) + f(n-2) with base cases $f(0) = 1$ and $f(1) = 1$. Let $c(n)$ denote the total number of times function $f$ is called (including the initial call) when computing $f(n)$. Which recurrence relation describes $c(n)$?