(Solved): 5. (20p) A connected component of a graph is a set of vertices where each node can reach every oth ...

5. (20p) A connected component of a graph is a set of vertices where each node can reach every other node in the component along the given edges, and which is connected to no additional vertices. For example, the graph \( G \) below has 3 connected components. Explain how to use Kruskal's algorithm to compute the number of connected components in a graph.