$1.$In the CRC algorithm, consider the $5-$bit generator, G$=10011,$ and suppose that D has the value $1010101010.$ What is the value of R$?$

$2.$Recall that with the CSMA$/$CD protocol, the adapter waits K x $512$bit times after a collision, where K is drawn randomly. For K $=100,$ how long does the adapter wait until returning to start transmission attempt $($Step $2)$ for a $10$ Mbps broadcast channel? For a $100$ Mbps broadcast channel?

$3.$One way of detecting errors is to transmit data as a block of n rows of k bits per row and add parity bits to each row and each column. The bit in the lower$-$right corner is a parity bit that checks its row and its column. Will this scheme detect all single errors? Double errors? Triple errors? We assume the errors only happen in the original data $($not in the parity bits$).($provide brief explanation on your answers$)$