Understanding Prim's Algorithm

Prim's Algorithm Explanation with Example

SOLVED: Prim's algorithm for MCSTs grows a trcc in natural way; starting from an arbitrary root; at each stage it adds a new branch to the alrcady constructed trec The algorithm stops when all nodes have been reached:Algorithm 1 Prim 1: T 2: B < v : an arbitrary vertex of V 3: while B # V do Find cheapest C = (U1. U2) such that U1 € B,u2 € V B T < TUe 4= BU u2 7: end whileAnswer the following questions:Compare what happens in Kruskal's algorithm versus Prim's algorithm if we run them OI graph