Explain step

By step how to solve this problema$)$ Suppose that a packet's payload consists of $10$ eight$-$bit values $($e$.$g$.,$ representing ten ASCII$-$encoded characters$)$ shown below. $($Here$,$ we have arranged the ten eight$-$bit values as five sixteen$-$bit values$)$:

$00011101,10110001$

$10101100,11011100$

$01000111,11000000$

$00010101,00001010$

$01111011,01011000$

Compute the two$-$dimensional parity bits for each of the five rows and sixteen columns assuming odd parity. Assume that the parity bit in the lower right comer is computed so that the parity of the row parity bits in the last row has odd parity.