Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word:

0 1 1 1 1 0 1 0 1 0 1

Assuming even parity, according to our error-correcting code, in what bit is the error? Number the bits from the right starting at 1. If there is no error, enter 0.

(explain and show work)