Section 6.6 states that for a given positive integer t, if a code satisfies dmin>=2t + 1, then the code can correct all bit errors up to and including errors of t bits. Prove this assertion. Hint: Start by observing that for a codeword w to be decided codeword w', the received sqeuence must be at least as clode to w' as to w.