Let x1 < x2 < < xn be real numbers representing coordinates of n villages located along a straight road. a post office needs to be built in one of these villages. a. design an efficient algorithm to find the post-office location minimizing the average distance between the villages and the post office. b. design an efficient algorithm to find the post-office location minimizing the maximum distance from a village to the post office.

answer: a. 74

step-by-step explanation:

it shows divided evenly, so add the 37+37 = 74

b

step-by-step explanation:

we'll this would mean that the dunk tank and the bounce house are the same for 20 hours because the 2 represents that the two activities, and the 20 represents the amount of hours they both are. so with this said, it means that the answer is c. the costs for a dunk tank and bounce house are the same for 20 hours.

c.the costs for a dunk tank and bounce house are the same for 20 hours.

hope this .