Question

Given below are two statements :
one is labelled as
Assertion (A) and the other is labelled as
Reason (R).
Assertion (A) :
Prim’s and Kruskal’s algorithms always produce the same minimum total weight spanning tree for a given connected, weighted graph.
Reason (R) :
Both algorithms use same greedy properties of choosing the minimum weight edge at each step.
In the light of the above statements, choose the most appropriate answer from the options given below :

• A. Both (A) and (R) are correct and (R) is the correct explanation of (A)
• B. Both (A) and (R) are correct but (R) is not the correct explanation of (A)
• C. (A) is correct but (R) is not correct
• D. (A) is not correct but (R) is correct

Hint:

Remember: Unique edge weights $\implies$ Unique MST. Duplicate edge weights $\implies$ Multiple possible MSTs!

Answer 1

The Correct Option is D