Find $f(1)$, $f(2)$, $f(3)$, and $f(4)$ if $f(n)$ is defined recursively by $f(0) = 4$ and for $n = 0, 1, 2, ...$ by:
(a) $f(n + 1) = 3f(n)$
$f(1) = $
$f(2) = $
$f(3) = $
$f(4) = $
(b) $f(n + 1) = 4f(n) + 4$
$f(1) = $
$f(2) = $
$f(3) = $
$f(4) = $
(c) $f(n + 1) = f(n)^2 - 2f(n) - 2$
$f(1) = $
$f(2) = $
$f(3) = $
$f(4) = $
