Which of the following is false about Prim's algorithm?

• A. It is a greedy algorithm
• B. It constructs MST by selecting edges in increasing order of their weights
• C. It never accepts cycles in the MST
• D. It can be implemented using the Fibonacci heap