Let G be a simple graph with the vertex set V = {v1, v2, v3, v4, V5, v6}. Which of the following statements is certainly true about G? Select one or more: O a. G has at most 15 edges. O b. If G...

Extracted text: Let G be a simple graph with the vertex set V = {v1, v2, v3, v4, V5, v6}. Which of the following statements is certainly true about G? Select one or more: O a. G has at most 15 edges. O b. If G contains a vertex of degree 5, then G has no isolated vertex. O c. If G is a complete graph, then it has 30 edges. O d. G contains a cycle. O e. If G is bipartite, then it has at least 5 edges. O f. G has at least 5 edges. Og. If G is bipartite, then it has at most 8 edges.