It was claimed that anyone involved in the Hollywood film industry can be linked through their film roles to Kevin Bacon within six steps. You are suspicious of such a claim and decide to verify it...

It was claimed that anyone involved in the Hollywood film industry can be linked through their film roles to Kevin Bacon within six steps. You are suspicious of such a claim and decide to verify it using the given dataset.1. Before you start to verify the claim, you first notice that it is not possible for this claim to be true if the actor graph is not even connected. If the given undirected graph is not connected, then some vertices must be in different connected components. Briefly explain how you can find the number of connected components in an undirected graph. Include the runtime of your algorithm as well.