There are n cities on a highway with coordinates x1, . . . , xn and we aim to build K < n fire stations to cover these cities. Each fire station has to be built in one of the cities, and we hope to minimize the average distance from each city to the closest fire station. Please give an algorithm to compute the optimal way to place these K fire stations. The algorithm should run in O(Kn^2) time.

Alarge university wanted to study the relationship between completing an internship during college and students' future earning potential. prom the same graduating class, they selected a random sample of 80 students who completed an internship and 100 students who did not complete an internship and examined their salaries five years after graduation. they found that there was a statistically higher mean salary for the internship group than for the noninternship group. which of the following interpretations is the most appropriate? a. there could be a confounding variable, such as student major, that explains the difference in mean salary between the internship and no internship groups. b. we cannot infer anything from these data since the distribution of salaries is likely right skewed. c. you cannot draw any valid conclusions because the sample sizes are different. d. more students should complete internships because having an internship produces a higher salary.

In a transportation minimization problem, the negative improvement index associated with a cell indicates that reallocating units to that cell would lower costs. truefalse

Which of the following is correct? a. a tax burden falls more heavily on the side of the market that is more elastic. b. a tax burden falls more heavily on the side of the market that is less elastic. c. a tax burden falls more heavily on the side of the market that is closer to unit elastic. d. a tax burden is distributed independently of the relative elasticities of supply and demand.