Which of the following is false about the Kruskal’s algorithm?

• A. it is a greedy algorithm
• B. it constructs mst by selecting edges in increasing order of their weights
• C. it can accept cycles in the mst
• D. it uses union-find data structure