A wireless service provider deploys antennas on rooftops along a street to cover various

segments of the area. Each rooftop hosts an antenna, and each antenna has a coverage range

that begins at a single point on the street and extends to another point. While the coverage

ranges of neighboring antennas may overlap, it is undesirable to have intersecting antennas

causing interference. Design a greedy algorithm to determine the maximum number of

antennas that can be activated, ensuring that the coverage areas of any two activated

antennas do not intersect. Explain your algorithm in detail. Give the pseudo code and analyze

the time complexity $($Big$-$Oh notation$)$ of your proposed algorithm.