Consider the following undirected weighted graph:
Which of the following edges represents the correct execution of Prim’s algorithm to construct an MST?
1
(A, B), (A, C), (C, D)
2
(A, D), (A, C), (C, D)
3
(A, B), (A, D), (C, D)
4
(A, D), (A, C), (C, B)