Sliding Window Algorithm Explained | Built In

31. Draw a timeline diagram for the sliding window algorithm with SWS = RWS = 3 frames, forthe following two situations. Use a timeout interval of about 2 ×RTT.(a) Frame 4 is lost.(b) Frames 4 to 6 are lost.Hints/Help: Look at extra problem #32 for a timeline example. In this problem, assume that ittakes (1)/(4) RTT to transmit a frame. Use a timeout of 2 RTT.a) When frames 5 and 6 are received no ack is sent. An ack is sent for frames 4,5 and 6 oncethe retransmitted frame 4 is received.Somethin