Please do it on maple software if possible. Thank you.

Below is a collection of 8-bit words {i}i= 1.5} received after being encoded with Hamming Code II using the matrix G2 (see Lecture 5). For each word assume there could be only 0.1 or 2 errors. (A) For each of these words. 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 after 2 errors. Explain your solution. > r1. r2. 73. r4.75 := (1. 1. 1. 1.0.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), (1.0, 1.0.1.1.1.0); 0 0 0 1 1 1 0 0 0 1 1 0 r1, 72, 73, 74, 75:= (1.1) 1 1 0 0 0 1 0 0 Below is a collection of 8-bit words {i}i= 1.5} received after being encoded with Hamming Code II using the matrix G2 (see Lecture 5). For each word assume there could be only 0.1 or 2 errors. (A) For each of these words. 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 after 2 errors. Explain your solution. > r1. r2. 73. r4.75 := (1. 1. 1. 1.0.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), (1.0, 1.0.1.1.1.0); 0 0 0 1 1 1 0 0 0 1 1 0 r1, 72, 73, 74, 75:= (1.1) 1 1 0 0 0 1 0 0