Host A sends packets to Host B using the go$-$back$-$N $($GBN$)$ protocol with a window

size of N $>1$ packets. Assume that ACKs never suffer loss and retransmissions occur only due to time$-$out.

$($i$)$ Calculate the total number of transmissionsrequired to send a total of $2$N packets when every T

th packet suffers a loss. Assume that T $<=$ N$.[3]$

$($ii$)$ Calculate the total number of transmissions required to send a total of N packets when every T

th packet suffers a loss. Assume that $$ N$+1$

$2<$ T $<=$ N$.$ Write the

sequence numbers of the packets sent by A in the order in which they are sent. $[3]$

$($iii$)$ Assume now that instead of using the GBN protocol A and B use the SR protocol with a window size of N $>1$ packets. Calculate the total number of transmis$-$ sions required to send a total of $2$N packets when every T

th packet suffers a loss. Assume that $$ N$+3$

$2<$ T $<=$ N$.$ Write the sequence numbers of the packets sent by A in the order in which they are