Which of the following edges form a minimum spanning tree on the graph using Kruskal's algorithm? TXT Select one 02 (A-G) (G-C) (C-B) (C-F) (F-2) (E-D) O b. (A-G) (A-B) (B-C) (A-D) (C-F) (F-E) OC (A-G) (A-B) (A-C (A-D) (A-D) (CF) 0 d(A-G) (8-9 (E-F) (A-8] (C-) (0-5)