Consider three store-and-forward switches and two full-duplex point-to-point links. Node A is connected to node B by a 10 Mbps link and the propagation delay is 0.5 msec. Node B is connected to node C by a 10 Mbps link and the propagation delay is 1 msec. Node A sends 5,000 bit frames to node C, and node C replies to A with a 500-bit acknowledgement frame for each frame received. Assume that each frame generated at A contains 500 bits for the headers, and the remaining 4,500 bits are for payload. (a) Assume node A has an endless supply of frames to send to node C. What throughput can node A achieve if the stop-and-wait protocol is utilized? Assume that there are no errors and calculate the throughput in payload-bits per second. (b) Under the same situation, what is the maximum throughput that can be achieved if the sliding window protocol is utilized? (c) What is the smallest possible size for the senders window that achieves the maximum throughput found in part (b)