Suppose Host A and Host $B$ use a $GBN$ protocol with window size $N=3$ and a long$-$enough range of sequence numbers. Go$-$Back$-$N in action

Assume Host A sends six application messages to Host B and that all messages are correctly received, except for the first

acknowledgment and the fifth data segment. Draw a timing diagram $($as slide $61),$ showing the data segments and the

acknowledgments sent along with the corresponding sequence and acknowledge numbers, respectively.

Do the above problem but using SR protocol.