Suppose we run Dijkstra's Algorithm on a graph with $6$ vertices. We get the following final

$[10$ pts$]$

PRED and DIST.

$\backslash$table$[[$Index$,0,1,2,3,4,5],[$DIST$,0,10,10,15,20,25],[$PRED$,$N$,0,0,1,2,4]]$

Use this information to fill in the edges and weights for the corresponding shortest path tree below.

Note: You are not completing the graph, just the tree!

$(1)$

$(3)$

$(5)$

$(0)$

$(2)$

$(4)$

Put scratch work below. Scratch work is not graded but may be used for regrade partial credit.