Which of the following edges form a minimum spanning tree on the graph using Kruskal's algorithm? 3 2 1 5 5 G E 1 4 6 F 3 Select one: O a. (A-G) (A-B) (A-C) (A-D) (A-D) (C-F) O b. (A-G) (B-C) (E-F) (A-B) (C-F) (D-E) O c. (A-G) (G-C) (C-B) (C-F) (F-E) (E-D) O d. (A-G) (A-B) (B-C) (A-D) (C-F) (F-E)