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 r k 1 , r k 2 , . ., r k n . if the server can only use one path to send data to the client, what is the maximum throughput 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?

"curse these trig-loving pirates! " devora mutters as she looks at the map. then, after thinking for a moment, she walks back to the entrance of the secret cave, measuring 48 meters along the way. after performing a calculation, devora walks back to the empty treasure, faces the entrance, and turns a certain number of degrees to her left before walking 89 meters to the treasure. supposing that the angle at the cave entrance is acute and that devora's calculations were correct, how many degrees did she turn?