If the web graph has n vertices, what is the minimum possible pagerank that any vertex can have, as a function of n? Describe what needs to be true of a vertex to cause it to have this minimum value.

1 pagerank(y) pagerank(x) = 0.05 + 0.95 # vertices # edges out of y edge y + x