Prim’s algorithm can be efficiently implemented using _____ for graphs with greater density.

• A. d-ary heap
• B. linear search
• C. fibonacci heap
• D. binary search