Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: A