Question 3 4 pts Complete the steps for Prim’s Algorithm: This algorithm creates a minimal spanning tree given a connected graph [Select] a list of shortest paths from a given start vertex a minimal spanning tree a topological ordering Choose a start vertex do find the lowest weight edge from the current tree [Select] from the current tree from the predecessor in the graph that has not been used add this edge if it does not create a cycle [Select] makes a complete tree does not create a cycle makes a connected tree while the stack is not empty (Select] more edges exist numEdges < numVertices – 1 the stack is not empty numEdges < numVertices Show transcribed image text Question 3 4 pts Complete the steps for Prim’s Algorithm: This algorithm creates a minimal spanning tree given a connected graph [Select] a list of shortest paths from a given start vertex a minimal spanning tree a topological ordering Choose a start vertex do find the lowest weight edge from the current tree [Select] from the current tree from the predecessor in the graph that has not been used add this edge if it does not create a cycle [Select] makes a complete tree does not create a cycle makes a connected tree while the stack is not empty (Select] more edges exist numEdges

## Expert Answer

Answer to Question 3 4 pts Complete the steps for Prim’s Algorithm: This algorithm creates a minimal spanning tree given a connect…