Exercise $1.[$Reliability Protocols$]30$ points

Suppose that host A sends $N=9$ packets to host B using one of the following protocols we learned in class $($a$)$ Go$-$Back$-$N $($GBN$)($b$)$ Selective Repeat $($SR$)($c$)$ TCP $($considering only reliability, not congestion control$).$ All protocols have $($sender and$/$or receiver if applicable$)$ window sizes equal to $5$ packets and timeout value equal to $10ms.$ The one$-$way propagation delay between host A and $B,$ as well as from $B$ to $A,$ is $4ms,$ the transmission time of each data packet is $1ms,$ and the transmission time of each ACK packet is $0ms.$

Suppose that Packet No$.5$ is lost, the ACK generated when packet $2$ is received is also lost, and no other packet is lost. The beginning of the space$-$time diagrams are provided below; the sequence numbers refer to packets.

Fill out the rest of the diagrams until all $9$ packets are sent and acknowledged. Show all packets $($transmissions$,$ retransmissions and acknowledgements$),$ their sequence numbers and the times they were sent$/$received$.$

For each scenario, write down the total time, i$.$e$.,$ when all $9$ packets are successfully acknowledged to the sender A$.$

Go$-$Back$-$N$.$ Total time $=ms$