DM.2.G: Compare the results of solving the traveling salesman problem (TSP) using the nearest neighbor algorithm and using a greedy algorithm.