Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?

• A. (B-E)(G-E)(E-F)(D-F)
• B. (B-E)(G-E)(E-F)(B-G)(D-F)
• C. (B-E)(G-E)(E-F)(D-E)
• D. (B-E)(G-E)(E-F)(D-F)(D-G)