Once upon a time there was a city that had stone paths to travel. Here is the layout of the city. The number of paving stones between each house represents the distance of the paths. 1. Find the shortest route to travel from the mayor's house to Amanda's house. 2. Find the shortest route to travel to all houses and get back to the starting point using the TSP algorithm.

	Distance matrix
		To
From		1	2	3	4	5	6	7	8	9	10
	1	0	3	4	2	0	0	0	8	5	3
	2	3	0	2	0	0	0	0	0	0	0
	3	4	2	0	3	4	0	0	0	0	0
	4	2	0	3	0	3	4	0	0	0	3
	5	0	0	4	3	0	2	3	0	0	0
	6	0	0	0	4	2	0	3	4	0	4
	7	0	0	0	0	3	3	0	2	0	0
	8	0	0	0	0	0	4	2	0	4	5
	9	5	0	0	0	0	0	0	4	0	3
	10	3	0	0	3	0	4	0	5	3	0

	Distance matrix - 100 represents that travel from the given city to the selected city is not possible
		To
From		1	2	3	4	5	6	7	8	9	10
	1	0	3	4	2	100	100	100	8	5	3
	2	3	0	2	100	100	100	100	100	100	100
	3	4	2	0	3	4	100	100	100	100	100
	4	2	100	3	0	3	4	100	100	100	3
	5	100	100	4	3	0	2	3	100	100	100
	6	100	100	100	4	2	0	3	4	100	4
	7	100	100	100	100	3	3	0	2	100	100
	8	100	100	100	100	100	4	2	0	4	5
	9	5	100	100	100	100	100	100	4	0	3
	10	3	100	100	3	100	4	100	5	3	0