Imagine a sliding window protocol using so many bits for sequence numbers that wraparound never occurs. What relations must hold among the four window edges and the window size W, which is constant and the same for both the sender and the receiver? Use the following notation for the sender and receiver: Sl = Sender-lower and Su = Sender-upper to designate the lower and upper bounds of the sender's window. Likewise, use (Rl , Ru) for the receiver's window.