For a sliding window algorithm with SWS=4 frames and RWS=4 frames, the receiver uses cumulative ACKs. Use a timeout interval of about 2 x RTT. Assuming that the transmit time of a frame is equal to 0.25 RTT and the frames are processed instantaneously if they arrive in order. a. What is the maximum number of packets that can be transmitted in one RTT? b. What is the smallest value for MaxSegNum (the number of available sequence number)? C. Draw a timeline diagram (up to frame 6) for the situation when the Frame 2 is lost. d. Now, assume that the receiver sends a duplicate acknowledgement if it does not receive the expected frame. For example, it send DUPACK[2] (duplicated ACK) when it expects to see FRAME[2] but receives FRAME[3] instead. Retransmission takes place upon receipt of the first DUPACK. Draw a timeline diagram (up to frame 6) for the situation when the Frame 2 is lost. Note: for part c&d: On each data frame and ACK frame, you need to indicate the sequence number (start from 0). In addition, you need to indicate what action is taken by the receiver when a frame is received, for example, processed, buffered, or discarded