G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________

G is an undirected graph with n vertices and 26 edges such that each

1.	G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________
A.	7
B.	43
C.	13
D.	10
Answer» D. 10