Consider a sliding window protocol running at the optimum window size of $8$ packets. The sliding window protocol starts numbering packets from sequence number $1.$ Suppose nodes in the network get infected by a virus that causes them to drop packets with odd sequence numbers. Assume that the sender A uses a timeout of $40$ seconds and it takes $1$ sec for a packet to reach the receiver B$.$ The receiver buffers out$-$of$-$ order packets until it can deliver them in order to the application. Assume that ACK's are generated and sent for every packet received without error and t$..$ is negligible. What is the number of packets in this buffer $35$ seconds after the sender starts sending the first packet? Show the timing diagram for the sequence of events occurring in the$$above$$process