0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 1 1 Suppose that the graph G has adjacency matrix A = 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 0 Fill in the circle for the correct answer. There is a way to label the vertices of G so that the resulting adjacency matrix is block diagonal. There is not a way to label the vertices of G so that the resulting adjacency matris is block diagonal. 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 1 1 Suppose that the graph G has adjacency matrix A = 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 0 Fill in the circle for the correct answer. There is a way to label the vertices of G so that the resulting adjacency matrix is block diagonal. There is not a way to label the vertices of G so that the resulting adjacency matris is block diagonal