Graph Theory: Consider the following directed graph G(V, E). v1 v2 v3 v4 v5 e1 e2 e3 e4 e5 e6 e7 (a) Find the adjacency matrix (call it A) and the incidence matrix (call it B) of this graph. (b) Remove the direction of the arcs in the graph and find the adjacency matrix of the undirected version of this graph. Call the matrix C. (c) Find rank(B). (d) Show that BT1 = 0 , where 1 is the (column) vector whose components are all equal to 1, and 0 is the (column) vector whose components are all equal to 0. Based on BT1 = 0 , what can you conclude about the eigenvalues and eigenvectors of BBT ? (e) Set L = BBT . Show that L = D C, where D = diag(deg(v1), deg(v2), . . . , deg(v5)), namely, the degrees of vertices are on the main diagonal of D. (f) Without direct calculation, show that all the eigenvalues of L are nonnegative. (g) Without direct calculation, show that one of the eigenvalues of L is zero and the corresponding eigenvector is 1 . (h) Find det(L) without direct calculation.