PYTHON please

Problem 1 Consider the graph given in Fig. 1: a. Construct the adjacency matrix (20points) b. Make a histogram for the degree distribution (20points) 6 3 5 4 Fig. 1 Problem 2 Using the network of problem 1: a. Calculate the average degree and average path length (10points) b. Calculate the clustering coefficient for each node (24points) c. Calculate the clustering coefficient for the network (6 points) Problem 3 Given a graph G (N, p) with N=10 and p=0.3 a. Construct a table for values of network degree k ranging from 0 to 10 with columns representing et.*, k! and P(k), where P(k) is the Poisson degree distribution given by P(k) = e- * k! Note that e is a constant. k! P(k) k 0 1 2 3 4 5 6 7 8 9 10 (10points) b. Plot the function P(k) vs k (10points)