A traveling salesman needs to make sales calls on 11 cities in the United States. The salesmans home base is Chicago. Complete the following:

a) Use the Greedy Algorithm to determine a possible route that begins and ends in Chicago that ensures the salesman visits each city and minimizes the miles traveled. List out each step and the miles also state the total miles traveled to complete the circuit.

b) Make a weighted graph showing the route determined using the Greedy Algorithm.

	Atlanta	Boston	Chicago	Cleveland	Dallas	Denver	Houston	Kansas City	Las Vegas	Los Angeles	Miami
Atlanta		1075	715	730	830	745	800	820	1980	2185	665
Boston	1075		980	645	1870	2010	1965	1445	2750	3130	1550
Chicago	715	980		345	940	1020	1075	505	1780	2190	1390
Cleveland	730	645	345		1225	1375	1360	800	2090	2490	1365
Dallas	830	2010	940	1225		800	245	505	1230	1435	1395
Denver	745	2010	1020	1375	800		1040	605	760	1020	2130
Houston	800	1965	1075	1360	245	1040		750	1470	1565	1330
Kansas City	820	1445	505	800	505	605	750		1370	1635	1485
Las Vegas	1980	2750	1780	2090	1230	760	1470	1370		270	2570
Los Angeles	2185	3130	2190	2490	1435	1020	1565	1635	270		2885
Miami	665	1550	1390	1365	1395	2130	1330	1485	2570	2885