Exam 2: Business Efficiency

For the graph below, what is the cost of the Hamiltonian circuit obtained by using the sorted-edges algorithm?

In some states, license plates use a mixture of letters and numerals. How many possible plates could be constructed using three letters followed by three numerals?

Suppose a maintenance worker needs to empty garbage dumpsters from five locations on the grounds of a park in the most efficient way possible. Which technique is most likely to be useful in solving this problem?

The minimum-cost spanning tree produced by applying Kruskal's algorithm will always contain the lowest cost edge of the graph.