Any binary string can be broken into contiguous chunks of the samecharacter, called runs. For example, 001110100000 has:

Result

The recurrecence needed is the

B(n) = B(n-1) + B(n-2)

Explanation

For all x length of a string, it can be made by appending 0 or 1 to an x-length of the same string. Therefore, the strings of x-length with all even numbers run of ones has to be also made from n-1 length strings.

One form of doing it is by appending null at the end of all n-1 length strings resulting in B(n-1). If it is appended 1 to all those, then it turns out to be strings with all even runs, which an exception at the final having an odd run, disqualifyng it. Therefore the recurrence will be B(n) = B(n-1) + B(n-2), as shown before.

is this supposed to be a question ?

the answer is d.

by: nicholas dooley