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

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

a.  9

Nope, As the graph below shows, even if we choose the cheapest edges, we can not visit all the vertices even at a cost of 10.

Question #1