9.4. In the country, there are 20 cities. An airline wants to organize two-way flights between them so that from any city, it is possible to reach any other city with no more than $k$ transfers. At the same time, the number of air routes from any city should not exceed four. What is the smallest $k$ for which this is possible?

## 9th grade

## Second day