c) Referring to Fig.Q3(c), it is shown that TCP's AIMD (Additive Increase Multiplicative Decrease) algorithm would result in equal share of bandwidth among connections. Suppose that instead of a multiplicative decrease, TCP decreases the window size by a constant amount. Would the resulting AIAD (Additive Increase Additive Decrease) converge to an equal share algorithm? Justify your answer using a diagram similar to Fig.Q3(c)