5 Consider the following graph: of Flag Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal's algorithm? Select one: A. (d-f),(a-b),(d-c),(b-f),(d-e) B. (a-b),(d-f),(d-c),(b-f),(d-e) C. (a-b),(d-f),(6-1),(0-c),(d-e) D. (0-1),(a-b),(b-f),(d-e),(d-c)