Q$\mathrm{.}7)$ Consider each of the three congestion control algorithms that work in units of packets

and that start each connection with a congestion window equal to one packet. Assumean ACK is sent for each packet received in$-$order, and when a packet is lost, ACKs arenot sent fore lost packet and the subsequent packetswere transmitted. The lostpacket and the subsequent packets have to be retransmitted by the sender$.$ Wheneverthere is a packet loss and the sender times out in a RTT$,$ the congestion window size inthe next RTT has to be reduced to half of its size in the current RTT$.$

A

For simplicity, assume a perfect timeout mechanism that detects a lost packetexactly $1$ RTT after it is transmitted. Also, assume the cngestion window is always

less than or equal to the advertised window, so flow control need not be

considered.B$.$

Consider the loss of packets with sequence numbers $8,23,36$ and $48$ in their firsta

transmission attempt. Assume these packets are delivered successfully in their first

retransmission attempt.C$.$ Fill the tableindicatee RTTs and the sequence numbers of the packets sent.

The sequence numbers of the packets sent range from $1$ to $50.$

D$.$sequence numbers $1$ to $50,$ each packet holds $1$KB of data and that the RTT $=100$ms$.$

Compute the effective throughput achieved by this connection to send packets with