This can be done by brute force but no of path will be (n-1)!/2. From the choose the path of minimum length.
Else you can apply Floyed warshall Algortihm to calculate the path cost taken by the salesman. Which turn out to be 375.
Note : Here I read few of the comment which were saying that Kruskal or Primis can be applied to calulate the TSP but it is wrong as we all know that Kruskal and Prims create a Minimum Spanning Tree(Not path, Tree can have branches where we are finding optimal path for n-1 vertex and adding our starting vertex and the start and end to create a cycle.)