Problem
1. Suppose we maintain the priority queue as a sorted list in the general graph traversal implementations. What would be the worst-case running time, to within a constant factor? When would this method be appropriate, if at all?
2. Give counterexamples that show why the following "greedy" strategy doesn't work for either the shortest-path or the minimum-spanning-tree problems: "at each step visit the unvisited vertex closest to the one just visited."