Consider 5 cities of interest, namely

a) reno,
b) san francisco,
c) salt lake city,
d) seattle,
e) las vegas.

use information on the road network and derive the miles from one city to the other. assume a fixed metric of miles per gallon = 40 and derive the cost of each transition in terms of miles. then on that basis, conduct the following: create a graph with each of its vertices corresponding to one of these cities and its edges being weighted by the associated miles for each trip. note that if (and only if) to go from city a to b you must go through c then you must add one edge from a to c and one edge from c to b and there is no need to add an edge directly from a to b. solve the traveling salesman problem such that traveling salesman starts from reno, visits all cities in the above list and returns to list. solve this problem in the brutal force-way, i. e. by identifying all possible paths. submit your solution in terms of a) code, and b) a *.txt all possible paths and the best one selected by the algorithm.