(e) Total no. of cities = 20 Total no. of paths =20C2 = 190 (taking 2 cities at a time) Total no. of paths that a candidate has to cover = path to all the + path (comes back other cities to his city.) (19)(1) =20 Let n be the max. no. of candidates. 20n<190 n< 9.5 n is an integer ∴n=9.