Kruskal's algorithm is best suited for the sparse graphs than the prim's algorithm.

• A. True
• B. False