(4) Suppose we run the rich-getricher process to produce a graph on ve nodes, with the nodes arriving in the order 1, 2, 3, 4, 5. For nodes 2, 3, 4, and 5 the probability of choosing a node to link to uniformly at random is p = 1/4 and the probability of choosing an earlier node and copying their decision is 1 p = 3/4. Each of nodes 2, 3, 4, and 5 creates one outgoing link. We will assume in this process that if a node chooses to copy the decision of node 1, then this just means linking to node 1. 2