1. Using Warshall algorithm and Dijkstra algorithm to find shortest path from a to z. (figure 1) a 4 3 a 4 8 2 g 5 10 3 6 2. Find minimum spanning tree using kruskal algorithm and Prim algorithm. (figure 2) 10 13 1 Figure 1 d 7 15 2 5 Figure 2 5 b 2 e 18 h 20 7 19 Z f