(Solved): 2. Minimum spanning tree and shortest paths ( 25pts ) a) (7 pts) Find the minimum spanning tree in ...

2. Minimum spanning tree and shortest paths ( $25\mathrm{pts}$ ) a) (7 pts) Find the minimum spanning tree in the above graph using Prim's algorithm. Please show the step-by-step procedure. b) (7 pts) Find the minimum spanning tree in the above graph using Kruskal's algorithm. Please show the step-by-step procedure. c) (11 pts) Use Dijkstra's algorithm to obtain the shortest path from node A to all other nodes. Finish the remaining columns of the table and list the paths. Note: "best" means the next node that is selected into the cloud.