Solve the graph by using improved pagerank algorithm and Iteration $10$ times. Using

formula lis:

$r_j={\displaystyle \underset{\text{i}\text{i}\text{n}\text{j}}{\overset{?}{}}}d\frac{r_i}{d_i}+(1-d)\frac{1}{N}$

Where ri denote the PageRank of node i and di its out degree.