Using Dijkstra's algorithm, what is the shortest path and its cost from node A to node F? Complete the status of the table when the algorithm is done calculating the shortest path to show the value shortest path from A to every other node For the shortest path, remember to enter your answer separating nodes by conmas, no spoces (i.e. AB,C,D) Shortest Path from A to F: Cost: Final Dijkstra's table (one value per cell) Shortest Node distance from Previous Node