Explanation :
In prims algorithm we can select arbitary vertex
and them, find all the edges that connect the tree
to new vertex and find the minimum and add it
to the tree. So option “C” is correct
(d, f), C), (d, a), (a, b), (c, e), (F, h), (g, h) (g, i).