where alphabetical order is used to determine the rows and columns of the adjacency matrix). 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.