3 and 4

3. (10 points) The graph below represents an office building, and the labeled vertices the offices that need to be connected by a computer network. The numbers are the costs in hundreds of dollars. Find the minimum-cost network. (You must show it as a graph.) XA T 8 T 13 16* 9 126 7 12 7 T 12 X0 Xg M0 4. (10 points) A tourist is planning to visit all of the museums in one city. Which technique is most likely to be useful in planning: Eulerizing a graph, applying the nearest-neighbor algorithm, finding a minimum-cost spanning tree, or none of the above? Explain