There is a circular road around a military building complex and there are n check posts built around the perimeter of the circular road. For efficient communication between check-posts, it is decided to built transmitters along the road so that every check-post has a transmitter within 250m of it. (The distance is measured as the length of the shortest arc between two points along the perimeter of the circle) . m possible locations are identified where transmitters can be built. However, in order to avoid signal interference, it is recommended that there exists exactly one transmitter within 250m of a check post. Give an algorithm that finds the optimal locations for transmitters such that no check-post has more than one transmitter within 250m of it or returns that such a solution is not possible.