$2.(10$ points$)$ We saw that there were two optimal solutions to the traveling salesman problem when distances between nodes are symmetric $-$ namely, the optimal pathway and then its inverse, or mirror image. It is possible that distances $($or perhaps better thought of as costs$)$ are not symmetric between nodes. In the context of traveling specifically, perhaps driving one way between cities cause you to hit more traffic than going in the reverse direction. Or$,$ if flying, it actually takes longer to fly westLinks to an external site.! If the costs are not symmetric, how would this change the set up of the problem solution itself? Do you think the optimal, brute force solution would possibly be singular in that case? Explain your reasoning.