Q$5$: Let us suppose that we are using the Hamming algorithm for constructing errorcorrecting codes for a $16-$bit word. Let us also suppose that we are using odd parity.

a$.$ How many parity bits do we need?

b$.$ What are the positions of the parity bits?

c$.$ What is the length of the codeword?

d$.$ List the bits checked by every parity bit?

Parity bit check bits

Parity bit check bits

Parity bit check bits

Parity bit check bits

Parity bit check bits

e$.$ Construct the Hamming code $($codeword$)$ for the memory word $1101010100001111.($Underline the parity bits that you will insert$)$