Consider the cut {2, 3, 6}. What is the minimum weight edge crossing the cut?

How many distinct Edge objects are there in the adjacency-lists representation of an edge-weighted graph with V vertices and E edges?

Assume that we're running Kruskal's algorithm, and have only added the edge 0-7 so far. Which edge will be selected next?

Assume that we're running the lazy version of Prim's algorithm, and have only added the edge 0-7 so far. Which edge will be selected next?

Assume that we're running the eager version of Prim's algorithm, and have only added the edge 0-7 so far. Which edge will be selected next?

Assume that we're running one of our three MST algorithms, and have added the edge 0-7. How many edges are on the PQ for Kruskal's algorithm? Lazy Prim's algorithm? Eager Prim's algorithm? There are 16 total edges in the graph.