For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim’s algorithm to construct an MST?

A. (a, b), (d, f), (f, c), (g, i), (d, a), (g, h), (c, e), (f, h)
B. (c, e), (c, f), (f, d), (d, a), (a, b), (g, h), (h, f), (g, i)
C. (d, f), (f, c), (d, a), (a, b), (c, e), (f, h), (g, h), (g, i)
D. (h, g), (g, i), (h, f), (f, c), (f, d), (d, a), (a, b), (c, e)

Transcribed Image Text:

b 5 7 2 10 12 h 8