Consider the Go-Back-N protocol. Suppose the size of the sequence number space (number of unique sequence numbers) is N, and the window size is N. Show a scenario (give a timeline trace showing the sender, receiver, and the messages they exchange over time) where the Go-Back-N protocol will not work correctly in this case. What is the maximum window size for which the protocol will work correctly when the size of the sequence number space is N