GVELLES SEVES CIUSCILJU. 5. Calculate the local clustering coefficient of vertex E. O Exercise 2 (1 pt) A tree is a connected graph without cycles. What is the global clustering coefficient of a tree on n vertices? Why? Exercise 3 (1 pt) Taking the jumping probability a = 0.3, compute PageRank for the graph on the right. Exercise 4 (3 pts) Taking the jumping probability a = 1/4, give the matrices P. P. P required to compute PageRank for the graph on the right. (You do not need to compute PageRank.)