***ANSWER IN PYTHON PLEASE***

Suppose that G is a bipartite graph on a vertex set that is the disjoint union of two sets X and Y, where each edge connects a vertex in X to a vertex in Y. The projection of G onto the set X is the graph with vertex set X, where any two elements are joined by an edge whenever they are joined to a common element yY in the graph G. The adjacency matrix of the projection can be derived from the square A2 of the adjacency matrix A of G. Consilder the afflillation network below G, with 9 people labelled a to h, and five foci ('/ocal points" of interaction) labelled 1 to 5 : 1. Compute the adjacency matrix of G. 2. Draw the projection on (just) the people, in which two people are joined by an edge if they have a common focus. (Of course, one can do this easily by hand. It would be nice to get networkx to do it for you.) 3. Compute the adjacency matrix B of the projection and compare it to A2 (note that the two matrices have different sizes). What do you observe