Below is a collection of 8-bit words {r|i=1..6} received after being encoded with Hamming Code II using the matrix G2 (see Lecture 5). For each received word assume there could be no more than 2 errors. > rl, r2, r3, r4, r5, r6 := (1, 0, 1, 0, 1, 1, 1, 0), (1, 1, 1, 1, 0, 0, 0, 1), (0, 1, 0, 0, 1, 0, 0, 1), (0, 0, 1, 1, 1, 1, 0, 0), (0, 1, 0, 1, 1, 1, 0, 0), (0, 1, 0, 1, 1, 0, 0, 0); rl, r2, r3, r4, r5, r6 := (1.1) (A) For each of these words r; , determine how many errors happened during the transmittion. (B) For those words that have been transmitted without an error or with 1 error, correct the word if needed and recover the encoded 4-bit original (meaningful sequences w, by eliminating the parity bits from the 8-bit words. (C) For those words r, that have been received with 2 errors, show that the correct 8-bit words cannot be recovered unambiguously by identifying 2 (or more) different 8-bit words that would produce the same received (incorrect) word. Explain clearly why this leads to umbiguity. Below is a collection of 8-bit words {r|i=1..6} received after being encoded with Hamming Code II using the matrix G2 (see Lecture 5). For each received word assume there could be no more than 2 errors. > rl, r2, r3, r4, r5, r6 := (1, 0, 1, 0, 1, 1, 1, 0), (1, 1, 1, 1, 0, 0, 0, 1), (0, 1, 0, 0, 1, 0, 0, 1), (0, 0, 1, 1, 1, 1, 0, 0), (0, 1, 0, 1, 1, 1, 0, 0), (0, 1, 0, 1, 1, 0, 0, 0); rl, r2, r3, r4, r5, r6 := (1.1) (A) For each of these words r; , determine how many errors happened during the transmittion. (B) For those words that have been transmitted without an error or with 1 error, correct the word if needed and recover the encoded 4-bit original (meaningful sequences w, by eliminating the parity bits from the 8-bit words. (C) For those words r, that have been received with 2 errors, show that the correct 8-bit words cannot be recovered unambiguously by identifying 2 (or more) different 8-bit words that would produce the same received (incorrect) word. Explain clearly why this leads to umbiguity