Problem 4: (5 points) How many bit strigs of length five do have at least two consecutive ones
such that the sum of all the bits in the string is always odd?. For instance, 11000, 11110 are
NOT part of the solutions for this problem. Show ALL your work step by step to get credit.
Final answers MUST be provided in integer form.
Four important considerations for this problem:
• Brute force is not allowed in this problem. It must be solved using either permutations,
combinations or both.
• A bit can be 0 or 1
• Repetitions are not allowed in the final results