(1 point) This problem requires you to do some reasoning based on the total degree of a graph. Each part gives partial information about a graph. It's up to you to use the things you know about graphs to find the missing information. The graph G2 has 7 vertices, all of degree k. Also, G2 has 21 edges. What is k? The graph G3 has n vertices, all of degree 4. Also, G3 has 10 edges. What is n? The graph G has 9 vertices, all of degree 2. How many edges does G have?