Question 4 (10 pt) What is the Hamming distance of the code generated by the parity bit (explain why)? Use the bound provided by the error detection theorem to explain how many errors this code can detect. Question 5 (10 pt) Consider the following code: A: 000 000 B: 111 000 C: 000 111 D: 111 111 The code is used for error correction. The codeword A is sent, but two errors occur and R = 000 011 is received. Show if the code can successfully recover the originally sent codeword or not. Discuss your answer in detail