I think ans is C.
For a graph on n vertices to be DISCONNECTED, max no. of edges can be there when only one node is disconnected from the other and the rest (n-1) nodes are all connected to each other.
So no. of edges in $K_{n-1}$ is $\frac{(n-1)(n-2)}{2}$.