A recursive function $f(n)$ counts the number of binary strings of length $n$ that do not contain '11'. The recurrence relation is $f(n) = f(n-1) + f(n-2)$. If $f(1)=2$ and $f(2)=3$, what is $f(4)$?