There are one-way flights between 100 cities of a country. It is possible to fly starting from the capital city and visiting all other 99 cities and returning again to the capital city. Let N be the smallest number of flights inorder to form such a flight combination. Among all flight combinations (satisfying previous condtions), N can be at most ?<spanclass=′latex−bold′>(A)</span> 1850<spanclass=′latex−bold′>(B)</span> 2100<spanclass=′latex−bold′>(C)</span> 2550<spanclass=′latex−bold′>(D)</span> 3060<spanclass=′latex−bold′>(E)</span> None geometrygeometric transformation