D abc d e f g h i j | a 0 5 0 0 0 0 0 0 7 0 b 5 0 3 0 5 0 0 0 0 0 0 0 3 0 0 0 1 0 0 0 8 d0000608000 | 05 | 06 | 06 24 | 0 0 |f001|0600 300 g000 8200 500 h 0 0 0 0 4 3 5 0 0 0 700 000 000 2 | j 10 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 3. Given the following undirected graph in Matrix 1, provide a graphical depiction (i.e. nodes and edges) of a MST resulting from Kruskal's algorithm