Show a two-dimensional odd parity that has the smallest old number of parity bits for this bit pattern: 1001 0101 1111 Show how to correct a single bit error for that pattern. Can a second bit error be introduced that can be detected (but not corrected)