Option a is right answer
In a complete graph each vertex is associated with all other vertes . They dont have self loop
So in Complete graph of n vertices
each vertex has a degree of n-1
Therfore n vertex will have n (n-1) degree....1
And we know that sum of degree of vertex = 2*edges
n*(n-1) = 2*e
e = n(n-1)/2