4. Use Dijkstra's algorithm to find the shortest path between V1 and V7. Please justify your answer. Otherwise, you get 0 points.