Given a situation: You have data for the rail transport (i. e. train track) network in North America, including the length of each section of track. You need to compute the shortest (in terms of distance) route for a train traveling from New York City to Atlanta, GA. What to do; you must select three answers: a) Specify the type of graph most appropriate for data in question in terms of un-directed or directed, b) Specify the type of graph most appropriate for un-weighted or weighted. c) Choose the graph algorithm that is best suited to computing a solution: Breadth-First Search, Minimum Spanning Tree (Prim's or Kruskal's), Dijkstra's, Depth-first search. Unweighted graph Undirected graph Breadth-first search Depth-first search Dijkstra's Directed graph Weighted graph Minimum spanning tree