The function $f : \mathbb{N} \rightarrow \mathbb{N}$ is recursively defined as follows:
$$
\begin{align}
f(0) &= 6, \\
f(n) &= 4 \cdot f(n-1) + 2^{n} \ \ \mathrm{if}\ n \geq 1.
\end{align}
$$
Which of the following is true for all integers $n \geq 0$?