Suppose A is the adjacency matrix of an undirected graph. Let A2 be the squared matrix, obtained by matrix multiplying A by itself. Show that the (i,j) entry of A2 is the number of ways to get from i to j in exactly two hops (i.e., the number of paths of length two between node i and node j ). Hint: Consult your linear algebra notes/textbook to remember a formula for the (i,j) entry of the product of two matrices