Consider the $2-$dimensional parity check code, in which a block of bits is organized

in a table $($rows and columns$)$ and a parity bit is calculated for each row and column.

Consider a block of $mm$ data bits, there will be $m$ row parity bits and $m$ column

parity bits.

$($i$)$ Determine the minimum hamming distance of the set of codewords using this

code.

$($ii$)$ How many errors are guaranteed to be detected using this code? Give an

example of an error pattern that cannot be detected using this code.

$($iii$)$ How many errors are guaranteed to be corrected using this code? Give an

example how this code can correct such error.