Two functions are defined recursively:

• $f(n) = \begin{cases} 0 & \text{if } n = 0 \\ 1 + f(n-1) & \text{if } n > 0 \end{cases}$
• $g(n) = \begin{cases} 1 & \text{if } n = 0 \\ 2 \cdot g(n-1) & \text{if } n > 0 \end{cases}$

If $h(n) = g(f(n))$, what is $h(3)$?