Problem $3.$ Consider the sliding window algorithm with parameters SW S $>1$ and RW S $<=$ SW S$.$

$($a$)$ Find the smallest value for the MaxSeqNum such that the receiver never places frames out of order.

$($b$)$ Demonstrate via an example realization of frame losses $($in a timing diagram$)$ that if the MaxSeqNum is

reduced by one compared to your answer in $($a$),$ then the receiver places frames out of sequence. You can use

any choice of a SW S $>1$ and RW S $>1$ to demonstrate this scenario.