A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at most

A

n edges

B

(n - k) edges

C

(n - k) (n - k + 1) edges

D

(n - k) (n - k + 1)/2 edges