Suppose that s bits are used to represent the sequence number. In class we said that the maximum window size W for Go$-$Back$-$N protocol is W $=$ N $1,$ where N $=2$s $.$ The claim is that this is correct only when the packets cannot be re$-$ordered by the network during the retransmission, i$.$e$.,$ a packet, P$1,$ sent before another packet, P$2,$ by the sender cannot show up at the receiver later than P$2!$ Use an example $($say$,$ use s $=2)$ to show why W $=$ N $1$ will not work correctly if the network can indeed re$-$order the packets