Which of the following statement is false about Prim’s algorithm?

• A. Initially the roots key and nodes are initialized to zero.
• B. The complexity is O(E log V) using binary heap
• C. The time complexity is O(E + V log V)using Fibonacci Heap
• D. It may use binomial max heap to represent the priority queue