You are asked to develop a graph-based computer application to help plan travel between states. The most commonly used feature will be finding the shortest path between two states. What graph traversal algorithm is most appropriate for this application and why: Depth-First Search or Breadth-First Search? (Answer in 3-4 sentences. Your answer should be specific to this particular travel application.)