Congestion Control Algorithms

Various control algorithms are used to address network congestion during short peaks of data transmission. Which pair of pseudo$-$code snippets correctly represent the "Slow Start" and "Additive Increase Multiplicative Decrease $($AIMD$)"$ algorithms, respectively?

Pick ONE OR MORE options

$//$ Slow Start wnd $=1//$ wnd is the size of the congestion window while $($cwnd $<$ ssthresh$)$ do $//$

ssthresh is the slow start threshold for each ACK received do cwnd $=$ cwnd $+1$

$//$ AIMD if $($packet is acknowledged$)$ then wnd $=$ wnd $+1//$ cwnd is the size of the congestion window

else if $($packet is lost$)$ then cwnd $=$ cwnd $/2$

$//$ Slow Start wind $=1//$ wnd is the size of the congestion window while $($cwnd $<$ ssthresh$)$ do $/$I

thresh is the slow start threshold for each round$-$trip time $($RTT$)$ do cwnd $=$ cwnd $*2$

$/$ AIMD if $($packet is acknowledged$)$ then wnd $=$ wnd $*2//$ wnd is the size of the congestion window

else if $($packet is lost$)$ then cwnd $=$ cwnd $/2$