Use Dijkstra's algorithm (p 752 in the text) to find shortest paths from vertex A to vertex e of the following graph Make a table like the one on p755 of the text (you can use the table tool in Canvas: you probably need 7 rows and 9 columns) to trace the algorithm -12 B 14 C 2 -Oo E 10