Which of the following edges form a minimum spanning tree on the graph using Kruskal's algorithm? 9 f 16 on 3 8 7 9 4 B 13 20 Select one: O a. (B-E)(G-E)(E-F)(D-F) O b. (B-E)(G-E)(E-F)(D-E) O c. (B-E)(G-E) (E-F)(D-F)(D-G) O d. (B-E)(G-E)(E-F)(B-G)(D-F)