In the 7th part, it should be B_n=2^n-1+B₁+B₂+.....+B_n-1

Question 6: A block in a bitstring is a maximal consecutive substring of l's. For example, the bitstring 1100011110100111 has four blocks: 11, 1111, 1, and 111 For a given integer n 2 1, consider all 2" bitstrings of length n. Let Bn be the total number of blocks in all these bitstrings. For example, the left part of the table below contains all 8 bitstrings of length 3. Each entry in the rightmost column shows the number of blocks in the corresponding bitstring. Thus, B3 = 0+1+1+1+1+2+1+1=8 Determine Bi and B2 Let n 23 be an integer Consider all bitstrings of length n that start with 0. What is the total number of blocks in these bitstrings? Determine the number of blocks in the bitstring rt Determine the number of blocks in the bitstring 1.10 n-l Let k be an integer with 2 S k<-1.>