Consider a code with 4 bits denoted as aazaja, in a dataword and 7 bits denoted as a3aaaorriro in a codeword. The received codeword at the receiver is denoted as b.bbiboq2q1q0. The receiver calculates three syndrome bits as follows: S = b3 Si= b3 + b +qi +qo So= b3 + b + b Note that the code is a Hamming Code + b +bo+q2 +bo Syndrome SS So Corrupted bit i) The receiver assumes there is at most one bit error in the received codeword. The three- bit syndrome creates eight different bit patterns ("000" to "111"). For each bit pattern, please indicate which bit (among the seven bits in the received codeword) the receiver considers corrupted. (4 points) 000 001 None 90 010 modulo-2 modulo-2 modulo-2. 9 011 b 100 92 101 b 110 111 bo b Consider the above Hamming Code. For transmission of a 7-bit codeword, define 7-bit error pattern as follows: for each bit in the error pattern, if the bit is '0', it means that the corresponding bit in the codeword is correctly received; if the bit in the error pattern is '1', it means that the corresponding bit in the codeword is corrupted. We have totally 27-128 error patterns (from 0000000 to 1111111). All the error patterns except 0000000 are for cases with bit error(s). Among those 127 error patterns for cases with bit error(s), how many error patterns cannot be detected by the receiver? (2 points)