Design a greedy algorithm for the following problem. You are given n distinct points and one line L on the plane and some constant r > 0. Each of the n points is within distance at most r of line L (as measured along the perpendicular). You are to place disks of radius R centered along line L such that every one of the n points lies within at least one disk. Your algorithm should run in O (n*log n) time and use a minimum number of disks to cover all n points.