The matrix A is called irreducible if all the elements of the matrix (I A)n1 (the (n 1)st power of I A) are positive. Show that A is irreducible if and only if the graph GA is strongly connected, i.e., for every vertex i and every vertex j there is a directed path from vertex i to vertex j