2. Rural Cell Phone Towers The cell phone service provider Vorizan has decided to invest in cell towers in rural areas. Here, a rural area can be treated as a long straight road with houses along it Vorizan's objective is to deploy the least number of cell towers along the road so that every house will be within 3000 or fewer meters of a cell tower. Your task is to develop a greedy algorithm that takes as input an array of n point:s on a line, representing the locations of n houses. Each point is the distance in meters from the left starting point of the road (the origin) and those points are in sorted order (increasing distance from the starting point). The algorithm must return a sorted array of positions at which to place the cell towers. That array must use the least number of cell towers possible. (Aside: this is a 1D variation of the set cover problem.) (a) [2pts| Describe the simplest greedy algorithm that you can for this problem (b) [2pts] What is the worst-case asymptotic runtime of your algorithm? Give the best bound that you can and explain in a sentence or two (c) [2pts] Prove the correctness of your algorithm