The graph Gnp has n vertices and a random node is linked with another node with probability p and is not linked with probability 1 - p. For any pair of vertices, a link exists with probability p and does not exist with probability 1-p. Study experimentally the size of the giant component in the Gn,p graph by varying the size of p and n by drawing a plot of the number of connected components as p varies, for n 10000 nodes. m.p The graph Gnp has n vertices and a random node is linked with another node with probability p and is not linked with probability 1 - p. For any pair of vertices, a link exists with probability p and does not exist with probability 1-p. Study experimentally the size of the giant component in the Gn,p graph by varying the size of p and n by drawing a plot of the number of connected components as p varies, for n 10000 nodes. m.p