9. (15 points) Consider the following greedy approximation algorithm for Traveling Salesman Problem (TSP). . Choose an arbitrary city as the start . Repeat until all cities have been visited: go to the next unvisited city closest to the one visited last (break ties by choosing the lexicographically smallest closest city, e.g., a is less than b, b is less than c, and so on) . Return to start city