my answer is C
but the answer given is A
someone please explain
Follow definition of Maching,
a complete bipartite graph with minimum no of edges hence K_{n-1,1}
total vertices (n-1+1)=n
total edges=(n-1)*1=n-1(it is minimum)
hence matching no is =min(n-1,1)=1;