Suppose a Web graph is undirected, that is, page i points to page j if and only page j points to page i. Are the following statements true or false? Justify your answers briefl y. (a) The hubbiness...

Suppose a Web graph is undirected, that is, page i points to page j if and only page j points to page i. Are the following statements true or false? Justify your answers briefl y.

(a) The hubbiness and authority vectors are identical, that is, for each page, its hubbiness is equal to its authority.

(b) The matrix M that we use to compute PageRank is symmetric, that is, M[i; j] = M[j; i] for all i and j.