Consider a Cyclic Redundancy Check $($CRC$)$ code. The divisor at the sender and Consider that a communication system uses an automatic repeat request $($ARQ$)$ protocol. The

distance between the sender and receiver is $3,000,000$ meters, and the propagation speed is $3\backslash$times $108$

meters per second. We only consider propagation delay and ignore all other delay $($and therefore,

the transmission time of a frame can be infinitely small and can be approximated as zero in your

calculation$).$ The time$-$out value of a timer is $1$ second. At the sender side, there are an infinite

number of packets in Layer $3$ to be sent. The size of a data frame is $1000$ bits.