Answer in Python code, using networkx

3. Constructing examples. Tasks 1. Give an example of a graph on 8 vertices all of which have degree centrality equal to 4. For such graph, also compute the normalised eigenvector, doseness and betweenness centralities. What do you cbserve? 2. Determine the normalised degree centrality of the nodes in some random trees. Is there some function of the degree centrality that is constant across you examples? Why? 3. Give an example of a graph on n=6,7,8 vertices which has a unique node that is highest ranked with respect to normalised degree, closeness and betweenness centrality, Can you think of such an example for any m