Question: 3 Consider the following array: 1 072509035 2 0 71 70 73 75 3 72 71 0 077 90 45070oo 0 60 40 5 90

3 Consider the following array: 1 072509035 2 0 71 70 73 75 3 72 71 0 077 90 45070oo 0 60 40 5 90 73 7760 0 80 6 3575 90 40800 Starting with vertex y4, 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) a. b. Use Dijkstra's algorithm to find the shortest paths from vertex vs to all other vertices for the graph represented by this array. (20 Pts.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
