please choose all true statements about graph group of answer choices the total number of edges present in a n vertices cycle is n 1 none of the rest are correct the total number of edges present in a complete bipartite graph km,n is (m-1) x (n-1) can a graph with 8 vertices all with degree 5 can a graph with 9 vertices all with degree 5 the total number of edges present in a n vertices cycle is n the total number of edges present in a complete bipartite graph km,n is m n the total number of edges present in a complete bipartite graph km,n is m x n a graph may contain many edges and no vertices. the total number of edges present in a complete n vertices graph is (n *(n 1))/2 a graph may contain no edge and many vertices. the total number of edges present in a complete n vertices graph is (n *(n-1))/2