Consider a sender A transmitting data packets, one at a time, to the receiver B over a link in the Internet. Since Internet is full of 'errors', the sender A wants to get some sort of 'evidence' that the receiver B has received each packet correctly. The link between A and B is erroneous in that anything from A to B will be in error with probability p, while anything from B to A will be in error with probability q (0 S p, q<1). Assume that whenever B receives something from A, B can immediately figure out whether or not it's in error (with probability p or 1 - p) and sends out a positive (negative) acknowledgement packet back to A (which is subject to an error with probability q!). Assume that all error events are independent of each other. The sender A sends out one data packet at a time and waits for anything back from B, and retransmits the same data packet over and over again until A receives an error-free positive acknowledgement from B for the packet. Note that this happens only when there is no error in the packet from A to B and also no error in the corresponding positive acknowledgement from B to A. Assume that packet size is P = 9kbits (for data packet and also for the positive/negative acknowledgement packet). The link speed between A and B (either way) is R 3Mbps and the one-way propagation delay between A and B is 15ms. What is the average rate at which A can transmit data packets to B successfully (called 'throughput')? Show your step and express your answer in terms of p, q