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.

Last year, western corporation had sales of $5 million, cost of goods sold of $3 million, operating expenses of $175,000 and depreciation of $125,000. the firm received $40,000 in dividend income and paid $200,000 in interest on loans. also, western sold stock during the year, receiving a $40,000 gain on stock owned 6 years, but losing $60,000 on stock owned 4 years. what is the firm's tax liability?

The company financial officer was interested in the average cost of pcs that had been purchased in the past six months. she took a random sample of the price of 10 computers, with the following results. $3,250, $1,127, $2,995, $3,250, $3,445, $3,449, $1,482, $6,120, $3,009, $4,000 what is the iqr?

Amanda works as an industrial designer