b please

3- Consider the following array: | | 0 | | 72 | 50 | 90 | 35 2 0 7 70 73 75 | 72 | 71 | 0 | | 77 | 90 45070 0 60 40 5 90 7377 60 0 80 6 35 75 90 40 80 0 a. Starting with vertex v, 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 ys to all other vertices for the graph represented by this array. (20 Pts.)