Problem $7$: Dijkstra$$s shortest$-$path algorithm

$10$ points total

Suppose you set out to use Dijkstra$$s algorithm to determine the shortest distance from Denver to every other city in the graph.

$(7$ points$)$ Fill in the table provided in the appropriate section of ps$10$ to show how the distance estimates are refined over the course of the algorithm. Once a city is finalized, you should no longer include its distance in subsequent columns.

$(3$ points$)$ What path$($s$)$ does the algorithm discover from Denver to L$.$A$.?$ Include both the final shortest path and any temporary estimates for the shortest path that are later replaced. Give the paths in the form

A $->$ B $->$ C $->$ etc.

where A$,$ B$,$ and C are vertices.