Explain step by step how to solve this problemc$)$ Last, consider the example below that shows both the payload bits $($in plain text$)$ and the two$-$dimensional parity bits $($in bold$),$ and where exactly two of the payload or parity bits shown has been corrupted. In this example, odd parity is used.

$01011101,101100011$

$10101100,110111000$

$01000111,110000001$

$00010101,000010100$

$01111011,010010000$

$01100111,000000000$

Indicate the rows and columns of bits that have been flipped from their original value.

In this example, is it possible for you to determine the exact location of the bits that have been flipped $($i$.$e$.,$ to do error correction as well as error detection$)?$