$3.$ Suppose we want error correcting code that will allow all single$-$bit errors to be corrected for memory words of length $12.$

$($a$)$ How many parity bits are necessary?

$($b$)$ Using Hamming algorithm find the code word to represent the $12-$bit information word:

$100100011010$