A route with $11$ hops is selected to transmit a $100-$byte message. If a packet has a $10-$byte header, what is

the total transmission time with an optimal number of packets to carry the message?

Assume $1$ ns to transmit $1$ byte of data. All routers are store$-$and$-$forward.

Part $2$

After the sixth packet is transmitted, the route becomes unavailable. This problem is recognized by the

system only after packet $6$ is successfully received by the destination computer. Knowing that the

remaining packets are lost, a different route is immediately chosen to retransmit starting from packet $7$ to

the last packet. This is a longer route with $17$ hops. Determine the total transmission time for the entire

message $($from the first packet sent by the transmitter to the last packet received by the receiver$).$

Part $3$: extra credit

When the transmitter is instructed to retransmit the remaining packets starting from packet $7,$ it knows

how many bytes of the original message are still left to be transmitted. Suppose it recalculates the new

optimal number of packets to carry the remaining bytes, what is the total transmission time for the entire

message $($from the first packet sent by the transmitter to the last packet received by the receiver$)?$

Assume each packet requires a $10-$byte header.