Consider the following graph: Which of the following cannot be the sequence of edges added, in the given order, to form a minimum spanning tree by using Kruskal's algorithm? OA. (A,B); (D,F); (B,F);...

The letter that's not visible by light is E

Extracted text: Consider the following graph: Which of the following cannot be the sequence of edges added, in the given order, to form a minimum spanning tree by using Kruskal's algorithm? OA. (A,B); (D,F); (B,F); (D;C); (D,E) O B. (A,B); (D.F); (D;C); (B.F); (D,E) OC. (D.F); (A,B); (D;C); (B,F); (D,E) OD. (D.F); (A.B); (B,F); (D,E); (D;C) E. All of the above sequences can be added when using Kruskal's algorithm to build a minimum spanning tree. 17:15