66. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10.

a) How many parity bits are necessary?

b) Assuming we are using the Hamming algorithm presented in this chapter to design our errorcorrecting code, find the code word to represent the 10-bit information word:

1 0 0 1 1 0 0 1 1 0.