$1$ Point

After visiting A$,$ C$,$ E one can claim:

The shortest path from A to each of the following nodes $($potentially through only visited nodes$)$ is:

Which node should we visit next? $($or write "STOP" if you think the algorithm should terminate$)$

Last saved on Nov $04$ at $6$:$02$ PM

Q$2\mathrm{.}3$

$1$ Point

By "visiting" the node of your answer above, update the shortest distance table given.

Provide your distance table as a sequence of comma separated values in alphabetical node order,

without spaces $($e$.$g$.$ the distance table above would be input as $"0,8,1,4,3,8")$ ANSWER $2\mathrm{.}3$ please and the answer is not $0,8,1,4,3,7$