Yuckdonald’(qvh). the n possible locations are along a straight line, and the distances of these locations from the start of qvh are, in miles and in increasing order, m1, m2, . . , mn. the constraints are as follows:
• at each location, yuckdonald’s may open at most one restaurant. the expected profit from opening a restaurant at location i is pi, where pi > 0 and i = 1,.
• any two restaurants should be at least k miles apart, where k is a positive integer.
give an efficient algorithm to compute the maximum expected total profit subject to the given constraints.