Refer to Figure $3\mathrm{.}55,$ which illustrates the convergence of TCP$\text{'}$s AIMD algorithm. Suppose that Instead of a multiplicative decrease, TCP decreased the window size by a constant amount. Would the resulting AIAD algorithm converge to an equal share algorithm? Justify your answer using a diegram similar to following Figure $3\mathrm{.}55$equal bandwidth shareConnection $2$ throughputConnection $1$ throughputR