help me as soon as posible please!

a) 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): 001101001111011010110111010011101101110000001101 1101100000010 - 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 corner is computed so that the parity of the row parity bits in the last row has odd parity. b) Now consider the example below that shows both the payload and the two-dimensional parity bits (shown in bold tex1), and where exactly one of the payload or parity bits shown has been corrupted. In this example, odd parity is used. 001101101110011011011011101001110111011100000011011101111000001001001010101100000010110110111010010100 - Indicate the row and the column location of the bit that has flipped from its original value c) 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. 001101001110011011011011101001110111011100000011011101111000011001001010101100010010110110111010010100 - 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)