Q5. Suppose Host A and Host B use a GBN protocol with window size N = 3 and a long-enough range of sequence numbers. 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 (similar to the Figure below), showing the data segments and the acknowledgments sent along with the corresponding sequence and acknowledge numbers, respectively. Sender send pkto send pktl send pkt2 X (loss) send pkt3 (wait) Receiver rcv pkto send ACKO rcv pktl send ACK1 rev pkt3, discard send ACK1 rev ACKO send pkt4 rcv ACK1 send pkt5 pkt2 timeout send pkt2 send pkt3) send pkt4 send pkt5 rev pkt4, discard send ACK1 rev pkt5, discard send ACK1 rev pkt2, deliver send ACK2 rev pkt3, deliver send ACK3 Go-back-N in operation