Questions 10-13 all refer to the following graph, which has costs associated with each edge:

13. The minimum cost to visit all vertices of the graph is: