$1\mathrm{.}4-05$b$.$ Performance: End$-$to$-$end Delay. Consider again the network shown above. Assume that the propagation delay is $10$ ms per link. Note that each of the two sessions has a $3-$hop path from source to destination.

Suppose Sender B is idle and only Sender A is active. What is the end$-$to$-$end delay of a packet from when it first begins transmission at Sender A$,$ until it is received in full by Receiver C$?$ Assume store$-$and forward packet transmission. You can assume the queueing delays are zero.

$50$ msec

$57$ msec

$60$ msec

$80$ msec

$100$ msecConsider multiple parity bits for a two$-$dimensional array of data bits: Transmit data as a block of i rows of $j$ bits per row and add parity bit to each row and each column. For i rows and j columns, compute j column parity bits $($last row$),$ i row bits $($last column$),$ and one corner parity bit computed by the row and column parity bits. Suppose $i=j=4,$ and the errorfree data block and the parity bits are shown below.

$1,0,1,0,1,1$

$1,1,1,1,0,0$

$0,1,1,1,0,1$

$0,0,1,0,1,0$

Consider the following bit error patterns. Give the number of row parity errors, column parity errors, and corner parity errors.

$1,0,1,0$

$1,1$

$1,1,1,0$

$0,0,0$

$2,1,1$

$1,1,0$

$3,1,0$

$3,1,1$Consider multiple parity bits for a two$-$dimensional array of data bits: Transmit data as a block of i rows of $j$ bits per row and add parity bit to each row and each column. For i rows and j columns, compute j column parity bits $($last row$),$ i row bits $($last column$),$ and one corner parity bit computed by the row and column parity bits. Suppose $i=j=4,$ and the errorfree data block and the parity bits are shown below.

$1,0,1,0,1,1$

$1,1,1,1,0,0$

$0,1,1,1,0,1$

$0,0,1,0,1,0$

Consider the following bit error patterns. Give the number of row parity errors, column parity errors, and corner parity errors.

$1,0,1,0$

$1,1$

$1,1,1,0$

$0,0,0$

$2,1,1$

$1,1,0$

$3,1,0$

$3,1,1$