Can anyone help me with this question, please. It is about Computer Networks: TCP

Suppose that, when a TCP segment is sent more than once, we take SampleRTT to be the time between the original transmission and the ACK, as in Figure 5.10(a). Show that if a connection with a 1-packet window loses every other packet (ie., each packet is transmitted twice), then EstimatedRTT increases to infinity. Assume TimeOut EstimatedRTT; both algorithms presented in the text always set TimeOut even Sender Receiver Sender Receiver naltr FIGURE 5.10 Asociating the ACK with Gal original tammisiness 01 ntansmision