Use Prim's Algorithm or Kruskal's algorithm to construct a minimum cost spanning tree (MST) from the graph shown below. A H 47 9, K 12 5 B G 34 13 19 18 node 26 E M edge and weight What is the total cost of the MST? 3.

Use Dijkstra's algorithm to construct a shortest path tree starting from vertex_ that includes all vertices in the original graph. Use the format shown in the given table. After filling in the table, draw the resulting shortest path tree in the empty box. 2 6 b fringe list 2 a STEP vertices in tree next edge to add 9 9 1 d с 4 12 2 2 2 f 9 1 h 3 4 5 6 7 8

PLEASE ANSWER ALL QUESTIONS AND SHOW AND EXPLAIN STEPS THANK YOU. PLEASE I NEED THIS ASAP.

Question 3: Find the Minimum Spanning Tree for the given graph using Prim's algorithm and write the steps. A 4 2 11 с F 8 7 1 2 E D 6 B 7 4 2 G H 5 9 10 T