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