Consider a simplified TCP,S AMID algorithm where the congestion size is measured in number of segments not in bytes in additive increase the congestion window size increases by one segment in each RTT in multiplicative decrease the congestion window size decreases by half (if the result is not an integer, round down to the nearest integer) suppose the two TCP connection C1 and C2 share a single congested link of speed 30 segments per second assume that both C1 and C2 are in the congestion avoidance phase. Connection C1 RTT is 100msec anc C2 RTT is 200msec. Assume that when the data rate in the link exceeds the links speed all TCP connections experience data segment loss.
a) if both C1 and C2 at time t0 have a congestion window of 10 segments wha =t are their congestion window size after 2200 msec.