$($a$)$ This question is related with sliding window concepts used fr GBN$,$ SR apd TCP$.$ Asume the thllowing Sonds $5$ segments to receiver $R$ and the $2^{st}$ segment is lost $($in the first attempt$).$ Finally all the sermene tre received by $R$ correctly after doing retransmission of $2^{21}$ segment.

total and how many ACK has R successful transmission of $5$ segments. How many scemicnts has S sent in Answer this for GBN$,$ SR and TCP$.$

$($ii$)$ Provide the sender window and recoiver window at the isstance when $5$ puckets ure sent, $2^{ed}$ segment in tost and $4$ packets are received at $R$ in case of $SR.$

$($iii$)$ Prowide the link vatilization in the presented scenario.

$($r$)$ How many timers are required at the sender side of CABN, TCP and SRF$)$

$($t$)$ This question is related with eongestion control in TCP$\text{'}$T Iahoc $($Nlow stant fongestion actulames for retransait$)$ and ICP Reno, $($TCP Tahoe $+$ fast rocowery$)$ Assume that. ICP receiver ackrowledyer cekty segment $($no delayed acknowledgements$).$ Also assume that RTT is I second and transmission delwy of each scepmient and each acknowledgement is negligible.

WhSurpose TCP Tahoe sender stants transmission at t$-0$ and during transmiscion ${14}^t$ segment is lost. Depect the behasior of TCP session up to $12$ RTT$.$ Use the following table template for assistance:

$\backslash$table$[[$RTT$,$Cund Size,Sepment No$.$ Sent$],[0,1,1]]$

$(4)$ Repeat the part $($i$)$for TCP Rene and considering $12$ segment is loct. e$)$

$(1)$ How much time if will take for the sequence numbers of TCP to wraparound? How ICP wolves this problem

$7$roble What window scaling factor should be negotiated between sender and receiver for the masimum uritizatios of the link?