2. As you can see from above, a Hamming Code works as follows: Bit position 1 checks every other bit, starting from itself. Bit position 2 checks 2 bits, skips 2 bits, checks 2 bits, skips 2 bits..., starting from itself. Bit position 4 checks 4 bits, skips 4 bits, checks 4 bits, skips 4 bits..., starting from itself. Bit position 8 checks 8 bits, skips 8 bits, checks 8 bits, skips 8 bits..., starting from itself. Assuming I have 26 data bits, how many parity bits should I have and where should they be placed in the string? (2 points)