What is a minimum spanning tree? How do we create one? What is the shortest path problem? How do we determine the shortest path? Discussion of efficiencies should include "Big O" notation, such as O(1), O(log N), O(N), O(N^2), answer must be at least 10 sentences in length.