## Discussion Forum

Que. | If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then |

a. | we'll get a different spanning tree. |

b. | we'll get the same spanning tree. |

c. | spanning will have less edges. |

d. | spanning will not cover all vertices. |

Answer:we'll get the same spanning tree. |