Dijkstra's algorithm can be used to compute least$-$cost paths from a

ource. In the graph below, what is the shortest distance from node $A$ to

each of the destinations $,$ and $E?$ Also, in what order does

Dijkstra add the nodes $,$ and $E$ to the final set of least$-$cost

paths? Show your work