ans is D
in complete graph there is an edge between every pair of vertices. so in complete graph with n vertices the degree of each vertex is n-1 . so total degrees of all vertices n(n-1)
according to handshaking theorem
2x No of edges =sum of degree of all vertices (n(n-1) here)
so No of edges =n(n-1)2