i) An undirected graph G has 20 vertices and the degree of each vertex is at least 3 and at most 5. Which of the following statements is true regarding the graph G? The minimum number of edges that the graph G can have is 60. The maximum number of edges that the graph G can have is 100. The maximum number of edges that the graph G can have is 60. The minimum number of edges that the graph G can have is 30. .ii) If G is a connected undirected graph such that every vertex has degree at most k, and the shortest path between any two vertices has length at most 2, then the number of vertices in G can be at most k - 1 k + 1 k k - k