Problem $3[20$ points$]$

$($a$)\backslash ([\backslash$mathbf$\{10\}\backslash )$ points $\backslash (]\backslash )$ Consider a sliding window algorithm with $\backslash (\backslash$mathrm$\{$SWS$\}=4\backslash )$ and RWS $\backslash (=1\backslash ).$ Assume that packet numbering starts from $1$ and the timeout is set to Timeout $\backslash (=4$ T$\_\{$p$\}\backslash ),$ where $\backslash ($ T$\_\{$p$\}\backslash )$ is the one$-$way propagation delay. The transmission delay for a single packet is $\backslash ($ T$\_\{$t$\}=$T$\_\{$p$\}\backslash ).$ Further, assume that the receiver acknowledges the last packet received in order $($last accepted frame$)$ every time it receives a packet. Draw a timeline and compute the total delay for successfully transmitting the first $7$ frames when the following packets have been lost: Frame$[3]$ and ACK$[5].$ Repeat the same timeline when $\backslash (\backslash$operatorname$\{$SWS$\}=\backslash$mathrm$\{$RWS$\}=4\backslash ).$ Is there a difference in throughput $($or equivalently, delay$)$ between the two sets of parameters?