Question 6: A block in a bitstring is a maximal consecutive substring of 1's. For example, the bitstring 1100011110100111 has four blocks: 11, 1111, 1, and For a given integer n1, 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. Esch entry in the rightmost column shows the number of blocks in the corresponding bitstring. Thus, 0 1 11 Determine Bi and B.2 . Let n3 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 ofblocks in the bitstring - Determine the number ofblocks in the bitstring Let k be an integer with 2 k<-1.>