please solve this Q

Question

Q .    The maximum number of edges in an undirected graph (simple) with 52 vertices and 3 components are

Answer 1

$^{50}C_{2}$

And 3 components will be 2 single vertex making 2 components and 50 vertex complete graph making another component, 1225 edges will be there

Comments

@Tesla please tell me what i am missing Considering it as complete graph total edge=52C2-2(for 3 components )?

---

52C2-2 won't have 3 components

Take 5 vertex and 3 component and draw 5C2-2 resultant graph will be connected

But separate it as 3C2 and 2 isolated vertex you will get maximum edges

So for 52 vertex 50c2 + 2 isolated components will give max edges