Given an acyclic graph of a city where each edge represents a road in the city and each vertex represents an crossing. Write an algo to find out the minimum number of vertices at which a policemen will be kept so that all the roads are covered. If a policeman is kept at a vertex then all the edges connected to that vertex is said to be covered