1. Consider an end to end path from a server to a client shown as the figure. Assume that the links along the path from the server to the client are the first link with rate Rs bits/sec and the second link with rate Rc bits/sec. Suppose the server sends a pair of packets back to back to the client, and there is no other traffic on this path. Assume each packet of size L bits, and both links have the same propagation delay dprop.

1. What is the packet inter-arrival time at the destination? That is, how much time elapses from when the last bit of the first packet arrives until the last bit of the second packet arrives?
2. Now assume that the second link is the bottleneck link (i.e., RcRs). Is it possible that the second packet queues at the input queue of the second link? Explain.
3. Now suppose that the server sends the second packet T seconds after sending the first packet. How large must T be to ensure no queuing before the second link? Explain.

R bits/sec R bits/sec tttt