Consider the following claim: Claim: It is possible to find a bit-string with 34 binary digits, such that when considering all 4 digit substrings that start at an odd index, it contains every possible 4-digit substring exactly once. For example: 10001010 contains the 4-digit substrings 1000 (starting at index 1), 0010 (starting at index 3 ), and 1010 (starting at index 5). Prove the correctness of the claim