6. a. Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 11. How many check bits are necessary? (Write down how you compute the result.) (5 points) b. Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 01011 110 11 10 Is this a legal codeword, assuming odd parity? If not, where is the error? (15 points)