1. Consider the Erdos-Renyi random. graphs G(n, p) with mean degree . (a) Show that in the limit of large n the expected number of triangles in the network is (b) The clustering coefficient C is given as follows (Eq. 7.41 in Newman's book): 3 x number of triangles number of connected triples i. Show that the expected number of connected triples in the network is ii. Calculate the clusterii results), and confirm that it agrees for large n with the value given by C