Computer-Networks

Data transmitted on a link uses the following 2D parity scheme for error detection: Each sequence of 28 bits is arranged in a 4×7 matrix (rows r₀ through r₃, and columns d₇ through d₁) and is padded with a column d₀ and row r₄ of parity bits computed using the Even parity scheme. Each bit of column d₀ (respectively, row r₄) gives the parity of the corresponding row (respectively, column). These 40 bits are transmitted over the data link.

The table shows data received by a receiver and has n corrupted bits. What is the minimum possible value of n?