4. Ilustrate Prim’s algorithm by giving detailed steps to find the minimum spanning tree for the following graph. You must explain the steps. 10 5. Using Dijkastra shortest path algorithm find the shortest path fiom C to Show transcribed image text 4. Ilustrate Prim’s algorithm by giving detailed steps to find the minimum spanning tree for the following graph. You must explain the steps. 10 5. Using Dijkastra shortest path algorithm find the shortest path fiom C
OR
OR