POW #2: A Bit More About Bit Strings

A bit string is a sequence of digits consisting only of 0s and 1s. In the previous Problem of the Week you were asked how many 12-digit bit strings contain no consecutive 1s. Now figure out a formula f(n) for the number of n-digit bit strings containing no consecutive 1s, AND make clear how this formula is related to the Fibonacci sequence.

Return solutions ON PAPER to Laura Taalman, Burruss 127, by 9/15/04.
Make sure it is clear how you arrived at your answer.
Include your name and email address with your solution.