Computer Networks go-back-N protocol

Consider the Go-back-N protocol operating between nodes A and B under the following assumptions: Node A transmits data packets to B and has an infinite number of packets to send Window Size 4. Data packet transmission time 1 time units. ACK transmission time 0 time units. Timeout 5 time units. Round Trip Time (RTT) time unit The first packet that is sent is packet #1 and it starts transmission at time 0 The transmission of data packet is lost in the first attempt The acknowledgment of packet #3 is lost in the first attempt. The link between the 2 nodes is a standard point to point link in which packets are received in order. A separate timer is maintained for each packet. Use the diagram on the following page to draw what happens under the Go-Back-B protocol until time 12.0. Please underline the window for both sender and receiver immediately after all the marked time instances. For example, for the transmission of the first packet (assuming that it is not lost), the diagram should look as follows: Node A Node B Indicate the window Time 0.0 immediately after time 1.0 1 2 3 4 5 6 7 8 9 Time 1.0 Time 1.5 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 Time 2.0 Indicate the window immediately after time 1.5 Indicate the window immediately after time 20 If you make any assumptions, please state them clearly