1. When is the loop in Kruskal's algorithm executed [E]> times in a graph with no isolated subgraphs? Ashortest path 2. Apply the (a) Kruskal algorithm and then (b) the Dijkstra algorithm to find a minimum spannin tree for the graph below. Show all the changes made during execution of these algorithms. 2 3 d 16. 7 10 9 b 2 g 12 14 e