Unit $10$ Assignment

In the graph below, use Dijkstra's algorithm to compute the least$-$cost path from node $E$ to all destinations $($A$,$ B$,$ C$,$ D$,$ and $F).$ Show your work, including the order in which nodes $($A$,$ B$,$ C$,$ D$,$ and $F)$ are added to the set $S$ of nodes whose final least$-$cost paths are determined.