Draw the corresponding weighted adjacency matrix for graph 3-1 (use 0 to denote edges that do not appear in the figure). (b) (4) For graph 3-1, please list one valid breadth-first search sequence starting from vertex A. (c) (8) Suppose that you have access to the sorted weight list in an ascending order in O(1), which of the minimum cost spanning tree algorithms (Prim or Kruskal) would you use to achieve a better running time performance for graph 3-1? Justify why your selected algorithm is better suited for the above graph. Show the final result of the minimum spanning tree obtainedgs to activate A LO 5 B 3 C 4 E 9 3 D LL 3-1 7 6 7 G 2 H 5 I