Villages all occur along a straight line as coordinates V, V2,... Un. A telecom tower at coordinate t; on the line services a village v, if the absolute distance vj til 4. (A single tower can service multiple villages in its range.) Give an algorithm to place a minimal set of towers on the line (i.e. output t, t2,..., tr with least possible r) which together service all the villages. Prove the optimality of your algorithm and compute its complexity.