(Solved) : 3 Consider Following Array 1 000 72 50 90 35 2 00071 70 73 75 3 72 71 0 77 90 4 50 70 0 60 Q37212632 . . .
Algorithms. Please solve question 3. Use java if needed orpseudocode
3. Consider the following array: 1 000 72 50 90 35 2 00071 70 73 75 3 72 71 0 77 90 4 50 70 0 60 40 5 90 73 77 60 0 80 6 35 75 90 40 80 0 Starting with vertex va, trace through Prim’s algorithm to find (a) a minimum spanning tree for the graph represented by the array shown here. 0) Show the st f ds that mptic the m (c) What is the cost of the minimum spanning tree? Show transcribed image text 3. Consider the following array: 1 000 72 50 90 35 2 00071 70 73 75 3 72 71 0 77 90 4 50 70 0 60 40 5 90 73 77 60 0 80 6 35 75 90 40 80 0
Starting with vertex va, trace through Prim’s algorithm to find (a) a minimum spanning tree for the graph represented by the array shown here. 0) Show the st f ds that mptic the m (c) What is the cost of the minimum spanning tree?
Expert Answer
Answer to 3. Consider the following array: 1 000 72 50 90 35 2 00071 70 73 75 3 72 71 0 77 90 4 50 70 0 60 40 5 90 73 77 60 0 80 6…
OR