For the following questions, suppose that
t_frame = 1.100 milliseconds (time to transmit one frame)
t_ack = 0.020 milliseconds (time to transmit one acknowledgement (ACK or RR))
t_prop= 2.500 milliseconds (propagation time of medium, same in both directions)
Sender and receiver processing time is assumed to be negligible. The total time to deliver N frames starts at the beginning of the transmission of the first frame and finishes at the end of the receipt of the final acknowledgment.
(a) Compute the amount of time required to deliver 10 frames to the receiver with stop-and-wait flow control. Assume that all frames and ACKs are received correctly.
(b) Compute the amount of time required to deliver 10 frames to the receiver with sliding-window flow control with a window size of 5 frames. Assume that all frames and RRs are received correctly. Also, assume that the receiver sends an RR for every correctly received frame and that the send/receiver have a full-duplex link (i.e. can send and receive at the same time).