(Solved): Minimum spanning tree using Prim's algorithm Here you are asked to find the minimum spanning tree o ...

Minimum spanning tree using Prim's algorithm Here you are asked to find the minimum spanning tree of a given graph using Prim's algorithm. The weighted graph has seven nodes with edge weights noted as below. Edge Weight (0, 1) 270 (0, 3) 230 (0,4) 180 (0, 6) 150 (2, 4) 200 (2,5) (5,6) 290 250 Follow Prim's algorithm, and mark the minimum spanning tree starting from node 0. Provide all steps and working. This assignment is due Jul 1, 2022 at 7:00 pm, and it is worth 2.5% of the final grade.