Suppose we attempt to run the sliding window algorithm with sequence number space of size 2m , i.e. sequence numbers {0,1,2,..., 2m 1}. The N-th data frame (information frame, or I-

frame) will have sequence number I[N], N=0,1,2,..., which actually contains N mod 2m in its sequence number field. Suppose WS=5, WR=4, and m =3. Give an example in which the algorithm becomes confused (e.g., a scenario in which the receiver expects I[8] and accepts instead I[0], which have the same transmitted sequence number). No packets arrive out of order.