can someone please help me with this pythonetworksx assignment

2. Projections Suppose that G is a bipartite graph on a vortex set that is the disjoint union of two sets X and X, where each edge connects a vorto in X to a vertex in The projection of onto the set X is the graph with vertex est X. what any two elements are joined by an edge whenever they are joined to a common elementy in the graph G The adjacency matrix of the projection can be derived from the square of the adjacency matrix of Contider the affiliation network below. with people labeled A to K. and four fool labelled 1.2.3 and 4 ( 1. Computacicy matrix of 2. Dw the protection on the people in which two people ined by an edge they have a common focus of course, one can do this sy by hand it would be nice to get to do it for you 3 Com the ceny of the projection and compare it to! What do you observe? wat goes her