1.The Repetition3 code with 4-bit messages is only guaranteed to correct 1 error. What’s the largest number of errors that can possibly be corrected successfully by this code? Explain your answer....

1.The Repetition3 code with 4-bit messages is only guaranteed to correct 1 error. What’s the largest number of errors that can possibly be corrected successfully by this code? Explain your answer.

2.In the Hamming code, we never correct more than 1 error successfully. Prove why not.

3. (programming required) Write a program, in a programming language of your choice, to verify that any two codewords in the Hamming code differ in at least three bit positions.