3. Suppose G is a graph with vertices a, b, c, d, e, fwith adjacenty matrix 1010 0 10 01 1 1 0 0 0 01 1 1 1 0 010 01 1 101 0 1 1010 Find: a. the number of vertices in G. b. the number of edges in G. c. the degree of each vertex. d. the number of loops. e. the length of the longest simple path in G. f. the number of components in G. g. the distance between vertex a and vertex c