Terminal A is sending data to terminal B using a sliding window protocol with the window size equal to 5 and the maximum sequence number equal to 6 (sequence numbers begin with 0). We make the following assumptions: (1) use of go-back-n protocol, (2) A can send 5 packets before B receives the first one of the 5, (3) the retransmission timer at A is set to slightly more than the round-trip time. Suppose that the 3rd and 4th packets that A transmits are lost once and must be retransmitted. Show all packets that are sent by A by the time that B receives the 10th new packet transmitted by A. (Do not count retransmissions in arriving at the 10th "new" packet.)