Fоr the fоllоwing grаph: Suppose thаt Prim’s аlgorithm has been executed, starting from node F, up to the point at which there are six edges selected for inclusion in the minimal spanning tree. List these edges in the order that they are selected for inclusion, using notation similar to (A, B) to specify an edge. Suppose that the Kruskal’s algorithm has been executed, up to the point where there are six edges selected for inclusion in the minimal spanning tree. List these edges in the order that they are selected for inclusion. Kruskal’s minimum spanning tree algorithm uses a heap to quickly find the lowest cost edge not already chosen. What would be the running time of the algorithm if instead of using a heap, -the algorithm used a simple unsorted array to store the edges?
The prefix ____ meаns “between,” while the prefix ____meаns “within.”