(Solved): Consider the following graph: Execute Dijkstra's algorithm on this graph. What are your distances? ...

Consider the following graph: Execute Dijkstra's algorithm on this graph. What are your distances? \[ \begin{array}{l} \text { A:0, B:4, C:6, D:3, E:6, F:7, G:4 } \\ \text { A:0, B:4, C:5, D:3, E:8, F:6, G:4 } \\ \text { A:0, B:4, C:6, D:5, E:6, F:7, G:4 } \\ \text { A:0, B:4, C:5, D:8, E:6, F:8, G:4 } \end{array} \]