For the 'Go-Back-N' protocol, which of the following statements about the receiver is FALSE? The receiver uses a checksum to identify corrupted packets None of the mentioned The receiver needs to store all sequence numbers received since the beginning of the transmission The receiver can generate duplicate ACKS The receiver discards out of order packets

Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?

Consider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of k. Assume that the medium does not reorder messages. Answer the following questions: a. What are the possible sets of sequence numbers inside the sender's window at time !? Justify your answer. b. What are all possible values of the ACK field in all possible messages currently propagating back to the sender at time? Justify your answer.

Please give me correct solution.