1 2 3. implement Prim algorithm by yourself with the input graph: 11 A 7 E 3 6 1 2 and implement Kruskal algorithm by yourself with the input graph: 14 e 10 Suppose Dijkstra's algorithm is run on the following graph, starting at node A. B KNZ 6 F D H (a) Draw a table showing the intermediate distance values of all the nodes at each iteration of the algorithm. (b) Show the final shortest-path tree. B G I A S with the Bellman-Ford algorithm. H E D F (a) Draw a table showing the intermediate distance values of all the nodes at each iteration of the algorithm. (b) Show the final shortest-path tree.