consider the following weighted graph. use prim’s algorithm starting with vertex a to find a minimum spanning tree for the graph, and indicate the order in which edges are added to form the tree.
a)order of adding the edges: {a, e}, {b, e}, {c, d}, {b, c}, {d, f}, {f, g}
b)order of adding the edges: {a, e}, {b, c}, {c, d}, {d, f}, {f, g}, {b, e}
c)order of adding the edges: {a, e}, {f, g}, {b, c}, {c, d}, {d, f}, {b, e}
d) order of adding the edges: {a, e}, {b, e}, {b, c}, {c, d}, {d, f}, {f, g}