a. Suppose you XOR the first two bits of a string of bits and then continue down the string by successively XORing each result with the next bit in the string. How is your result related to the number of Is appearing in the string?
b. How does this problem relate to determining what the appropriate parity bit should be when encoding a message?