Q$23$: One of the following statement about Kruskal's algorithm is false:

a$.$ It starts with one source nodes to build the minimum spanning tree

b$.$ It starts with a forest that contains $V$ trees where each tree is one node

c$.$ It has the property that edges in the output set always form a forest, and when the algorithm terminates, the output set forms a single tree