Compute PageRank from the web graph image posted keeping in mind it features a series of deadends. .

There is a single node with a self-loop, which is also the root of a complete binary tree of n levels.

Suppose we recursively eliminate dead ends from the graph, solve the remaining graph, estimating the PageRank for the dead-end pages. What would be the Page- Rank assigned to each of the nodes?

Figure 5.10: A tree of dead ends