Which one of following statement is false about prim's algorithm?
a) It use a running time of O(Elog2V) using binary heap
b) It may use a binomial max-heap to represent the priority queue.
c) A fibonacci heap imlementation require O(E+V log2V)
d) Initially all keys of nodes in priority queue are set to infinity . The root's key is set to 0.