Apply Dijkstra's shortest paths algorithm to the following graph, starting at vertex f, indicating the resulting shortest paths tree by making the tree edges into solid lines. Next to each vertex, write the distance of the shortest path from f to that vertex