Find the MST using a) Kruskals algorithm and b) Prims algorithm (10 points each).

Show each step of the procedure and whats the minimum cost?

2) Show the order in which vertices are visited using a) DFS and b) BFS (10 points each). Edges that are given are undirected.

3) Give a topological sort (10 points). Assume < = ->.

4) Summary report on 2 of the 3 algorithms (Dijkstras, BellmanFords, Floyd-Warshalls) (15 points each)