Consider a long flow being transmitted in 1 kB packets by a transport protocol that (only) uses AIMD to control the window size. Initially, the window size is 10 kB. Every time the window opens to 20 kB, the last packet in the window is dropped, which is detected exactly after one round-trip time, and retransmitted.

1. How many packets are sent up to and including the first packet that is dropped? Hint: 10 packets can be sent immediately. Then the window size will increase by one. Start by calculating the window size of each round up until the packet is dropped.

2. How many packets are sent in total up to and including the second packet that is dropped? Hint: The second round will be the same. Dont forget about the retransmitted packet.

3. If the round trip time is a constant 10ms, how long does it take until the last packet is transmitted of a 16,500 kB file? Express your answer in seconds.