4. Ilustrate Prim’s algorithm by giving detailed steps to find the minimum spanning tree for the following graph You must ex exp๒in the steps. S. Using Dikastra shortest path algorihm find the shortest path from Cto t 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 ex exp๒in the steps. S. Using Dikastra shortest path algorihm find the shortest path from Cto
OR
OR