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