Consider Figure 1.19(b). Now suppose that there are M paths between the server and the client. No two paths share any link. Path k (k-1,..., M) con- sists of N links with transmission rates Rt R2, . . .,If the server can only use one path to send data to the client, what is the maximum tbroughput that the server can achieve? If the server can use all M paths to send data, what is the maximum throughput that the server can achieve