Write python code to do the following : D$.$ Plot and compare the sizes of the different connected components in each network. You can find the

connected components by starting from a random node, find all the reachable nodes from the starting

node and include in a component, then start from a random node outside the components you found and

repeat the process. Does any of the networks possess a giant connected component? Discuss the results

and how they relate to the network type

E$.$ Plot and compare a distribution of the normalized betweenness centrality of all three networks. The plot

should bucket the betweenness centrality values into small ranges $($e$.$g steps of $0\mathrm{.}01)$ against the number

of nodes in each bucket. Comment on how this result relates to the distribution of the connected

components.

F$.$ Apply Girvan$-$Newman's method on the three graphs to find the best community structure in the graph

based on the best modularity score for the obtained communities. Compare and comment on the

community structure in the three networks.