3- Consider the following array: 1 2 1 0 2 0 3 72 71 4 50...

 

Transcribed Image Text:

3- Consider the following array: 1 2 1 0 2 0 3 72 71 4 50 70 5 90 73 6 35 75 32F08F2 4 72 50 71 80 0 77 60 90 40 80 52276-8 6 90 35 70 73 75 77 90 60 40 80 0 a. Starting with vertex V4, use Prim's algorithm to find and draw a minimum spanning tree for the graph represented by this array. What is the cost of the minimum spanning tree(30 Pts) b. Use Dijkstra's algorithm to find the shortest paths from vertex v5 to all other vertices for the graph represented by this array. (20 Pts.) 3- Consider the following array: 1 2 1 0 2 0 3 72 71 4 50 70 5 90 73 6 35 75 32F08F2 4 72 50 71 80 0 77 60 90 40 80 52276-8 6 90 35 70 73 75 77 90 60 40 80 0 a. Starting with vertex V4, use Prim's algorithm to find and draw a minimum spanning tree for the graph represented by this array. What is the cost of the minimum spanning tree(30 Pts) b. Use Dijkstra's algorithm to find the shortest paths from vertex v5 to all other vertices for the graph represented by this array. (20 Pts.)