You are given a Undirected graph of N vertices and M edges edges are given to you in a format [Ai,Bi] and there are total m edges

Find the minimum No. of fully connected components such that in every component each vertex is connected to every other vertex. You may remove 0 to any no. of edges from graph to make that thing possible and have to find the minimum No. of connected components such that you can achieve that feat?

output the no of minimum connected components

Please co-operate with the image to understand the question clearly if not .enter image description here

I thought about it for an hour and also did wrote it but nothing I was able to come up with to solve it..
So I need help from community