Given that you have an initial constant $$f(0) = k$$ and a function f(n) which is given in terms of f(n-1), how would one eliminate the term f(n-1) and replace it with n, without compromising the function's output?
What are the general steps to achieve this for any given function? what functions can you not 'explicify' from a recursive function?