show the work please

Consider the following network structure. This is the so called bipartite network, where you can partition the set of nodes N into two sets A and B, such that if a link ij is in g then one of the nodes comes from A and the other comes from B. It has applications to markets, where for instance one of the sets consists of buyers and the other of sellers, as well as things such as the assignment of students to schools, researchers to labs, and so forth. (25 points) Write a code that computes the matrix to count the number of walks among the nodes for number of hops from 1 to 10. (Hint: think of power of adjacency matrix) Fill in the table below. (5 points) Please scan and upload your answer in Q6. Carefully read Q6's instructions, the more information you provide the easier it is to consider partial credits if needed. Q3.5 3 Points What pattern do you observe as the power increases? Can you think of a reason why that might happen