3. (8 pts.) Show how to use Dijkstra's algorithm to determine a shortest path from C to E. Fill in the table to show the operation of the algorithm. Then determine the minimum distance and a shortest path starting at C and ending at E.
A
3
B
6
4
2
5
C
3
D
4
E
2
4
5
6
F
7
G
A
B
C
D
E
F
G
($\infty$, –)
($\infty$, –)
(0, –)
($\infty$, –)
($\infty$, –)
($\infty$, –)
($\infty$, –)