Find a shortest spanning tree by Prim’s algorithm.

Find a shortest spanning tree by Prim€™s algorithm.

5 8. (7 10 (1 (2 (3 3 3 2.

PROBLEM SET 23.3: