0000 T-Mobile c@ > 10:35 PM blackboard.vsu.edu 12 10 19 Submission Instructions: Submissions should be made on Blackboard. (No email submission is allowed.) .(20 Points) Trace Kruskal's algorithm in finding a minimum-cost spanning tree for the undirected, weighted graph given below. (Show the spanning tree found as well as the steps required for Kruskal's algorithm.) 2(20 points) Trace Prim's algorithm in finding a minimum-cost spanning tree starting at vertex A for the undirected, weighted graph given below. (Show the spanning tree found as well as the steps required for Prim's algorithm.) 10 5 20 19 a (20 points) Find the order of the vertices of the following graph using topological sorting algorithm