10. (15 points) Assume that you want to solve the Traveling Salesman Problem for a graph given below. Your starting vertex is the vertex (a). (a) Present a travelling path to solve the problem. (6) Based on the travelling path of your answer to the question (a), present the travelling distance (or cost) of the path. c) Do you have only one optimal solution for the graph? (Yes/No). If your answer is no, present other optional path(s)