please type the answer. Thanks

1. A clique G = is an undirected graph where V is the set of nodes, E is the set of edges, and E = {(u, v) | U EV, UEV, u + v }. Intuitively, in a clique, there is an edge between any pair of nodes. Let the PageRank value of node i be X;. Prove that in a clique of n nodes (n > 1 ), the PageRank values all nodes are the same. The damping factor in PageRank is a and 0 is an undirected graph where V is the set of nodes, E is the set of edges, and E = {(u, v) | U EV, UEV, u + v }. Intuitively, in a clique, there is an edge between any pair of nodes. Let the PageRank value of node i be X;. Prove that in a clique of n nodes (n > 1 ), the PageRank values all nodes are the same. The damping factor in PageRank is a and 0