a) Consider two hosts A and B that are quite far apart (i.e., dpg >> dtx). They are communicating using Go-Back-N protocol with a window size of 5 and a sequence number space of 4 bits. Assuming A is the source of the data and B is the sink, i.e., this is a one-way data flow, and packets may be lost or corrupted but without reordering due to network routing. At present, the receive window at B is at [13], i.e., the next expected sequence number is 13. Consider the following (independent) events. i. B receives an uncorrupted data packet with sequence number 13. What will B do? Given this scenario, estimate what are the possible senders windows at A at this moment? ii. B receives an uncorrupted data packet with sequence number 11. What will B do? Given this scenario, estimate what are the possible senders windows at A at this moment? iii. B receives an uncorrupted data packet with sequence number 0. What will B do? Given this scenario, estimate what are the possible senders windows at A at this moment?