Question 2: Find the adjacency matrix of the given graphs with respect to the vertices listed in alphabetic order. Question 3: A graph G has order 24 and size 72. The degree of each vertex is 3,6 or 9 . There are 6 vertices of degree six. How many vertices of degree 3 and 9 ? Question 4: Find the cut vertices, cut edges, vertex connectivity and edge connectivity. Question 5: Determine whether the given pair of graphs is isomorphic. Exhibit an isomorphism or provide a rigorous argument that none exists