c$)$ In class we learnt about creating a random graph using the Erdos$-$Renyi model and using the

random tree model. Terry was inspired and wanted to create a random graph network that

has a preferential attachment mechanism. This means that nodes that already have a larger

degree, will preferentially get more of the new edges. The following hints tell you how Terry

wants to implement this as a program:

$($a$)$ Terry wants to first create a fully connected graph $G,$ that has $m_0$ nodes.

$($b$)$ Until he reaches the intended $n$ nodes $(n>>m_0),$ he adds one new node $i$ in each

iteration.

$($c$)$ He then randomly chooses $mij{p}_j=\frac{k_j}{{\displaystyle \underset{x}{\overset{?}{}}}{k}_x}n2.m{m}_0,nmGG[G]=2(m,m_0,n)$