(13) (Application: Google PageRank) Consider the graph below. 01 04 U2 (a) Just by looking at the graph, rank the nodes from most important to least important? Explain your reasoning in a complete sentence or two. (b) What is A, the incidence matrix of I? (c) By the Perron Frobenius Theorem, A has a unique largest eigenvalue. Use our iterative methods to approximate an eigenvector for the maximal eigenvalue. Use GeoGebra Give each entry of the eigenvector correct to 4 decimal. (d) Use the Simple Google PageRank (SGP) to rank the vertices of . e) How do your SGPR results compare to you visual ranking from part (a)? I encourage you to play around with other graphs, make a visual ranking, and then (with the help of you calculator) compute the SGPR and compare. I find this fun.) (13) (Application: Google PageRank) Consider the graph below. 01 04 U2 (a) Just by looking at the graph, rank the nodes from most important to least important? Explain your reasoning in a complete sentence or two. (b) What is A, the incidence matrix of I? (c) By the Perron Frobenius Theorem, A has a unique largest eigenvalue. Use our iterative methods to approximate an eigenvector for the maximal eigenvalue. Use GeoGebra Give each entry of the eigenvector correct to 4 decimal. (d) Use the Simple Google PageRank (SGP) to rank the vertices of . e) How do your SGPR results compare to you visual ranking from part (a)? I encourage you to play around with other graphs, make a visual ranking, and then (with the help of you calculator) compute the SGPR and compare. I find this fun.)