break these questions down, check if the answers are correct and explain how to get each answer.

V. (15 pts) Given the following graph, determine the shortest path from node U to node V uning Dijkstra's shortest path algorithm. You must show a trace using Dijkstra's algorithm similar to the trace I did in elass, and clearly indicate your work. What is the shortest Pah? U (FV What is the kength of the shortest path? HOW THE LABELS THE NODES AS E TRACE