Travelling Salesman Problem pos in x pos in y City 1 10 10 City 2 11 5 City 3 12 18 City 4 9 11 City 5 8 4 City 6 6 12 City 7 2 13 City 8 7 19 a) Plot the points on graph paper and find a solution using the visual method. b) Plot the points on graph paper and find a solution using the space-filling curve method. c) Compute the Euclidian distances (if you don't know what this is, use Google) between every pair of points and find two different solutions using the nearest neighbor heuristic. d) Compute the total distance of each of the 4 solutions found above. e) Identify the best of the four routes.