One of the following is true. The Prim's algorithm running time depends on queue is: a) If Fibonacci heap is used then it is : O(E lg V) b) If binary heap is used then it is : O(V+E) c) If Fibonacci heap is used then it is : O(V Ig V+E) d) If binary heap is used then it is : O(V lg V+E) d