Given below are two statements: one is labelled as Assertion A and the other…
2026
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.
Assertion A: Kruskal's algorithm and Prim's algorithm always produce minimum spanning tree (MST).
Reason R: Every connected graph has a unique MST.
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
Attempted by 67 students.
Show answer & explanation
Correct answer: C
Kruskal's and Prim's algorithms are greedy methods guaranteed to find a Minimum Spanning Tree for connected weighted graphs, so Assertion A is correct. However, Reason R is false because a graph with equal edge weights can have multiple valid Minimum Spanning Trees. Therefore, Assertion A is true but Reason R is false.