Given the following undirected graph in Matrix 1, provide a graphical depiction

of a SPT resulting from Dijkstras algorithm, assuming b is the source node. Be

sure to mark the final key value of each node

a b C d C f 8 h i a 0 5 0 0 0 0 0 0 b 5 0 3 0 5 0 0 0 0 0 c 0 3 0 0 0 1 0 0 0 8 d e f g 0 0 0 0 0 5 0 0 0 0 1 0 0 6 0 8 6 0 6 2 0 6 0 0 8 2 0 0 0 4 3 5 0 0 0 0 0 0 0 0 Matrix 1 h il 0 7 0 0 0 0 0 0 8 0 0 0 4 0 0 3 0 0 5 0 0 0 0 0 0 0 2 0 2 0 7 0 D a b c d e f g h i j a 0 5 0 0 0 b 5 0 3 0 5 0 0 0 Loto 0 0 0 0 3 0 0 0 1 0 0 0 8 d 0 0 0 0 6 0 8 0 0 0 e 0 5 0 6 0 6 2 4 0 0 f 0 0 1 0 6 0 0 3 0 0 8 0 0 0 8 2 0 0 5 0 0 h 0 0 0 0 4 3 5 0 0 0 i 7 0 0 0 0 0 0 0 0 2 j 0 0 8 0 0 0 0 0 2 0 Matrix 1 2. Given the following undirected graph in Matrix 1, provide a graphical depiction of a SPT resulting from Dijkstra's algorithm, assuming b is the source node. Be sure to mark the final key value of each node. (25 points)