For each of the weighted graphs below, apply the algorithms of Kruskal and Prim to find a minimum spanning tree for the graph, and apply Dijkstra's algorithm to find the distance between the vertices a and h, and a walk of that distance: (a) a a 8 b 6 4 6 b 2 1 d 1 3 1 C 3 d 3 3 4 3 2 4 O 1 e 5 f 2 5 5 6 2 8 g 1 h 00 g 4 h Activate Wir Go to Settings t