Consider the following graph:Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm?Marks : 1Negative Marks : 0Answer here(b,e)(e,f)(b,c)(a,c)(f,g)(c,d)(b,e)(e,f)(a,c)(b,c)(f,g)(c,d)(b,e)(e,f)(a,c)(f,g)(b,c)(c,d)(b,e)(a,c)(e,f)(b,c)(f,g)(c,d)

To determine which one of the given sequences is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm, we need to compare each sequence with the steps of Kruskal's algorithm.

Kruskal's algorithm for finding a minimum spanning tree works as follows:

1. Sort all the edges in non-decreasing order of their weights.
2. Initialize an empty set to store the minimum spanning tree.
3. Iterate through each edge in the sorted order: a. If adding the current edge to the minimum spanning tree does not create a cycle, add it to the tree. b. Otherwise, discard the edge.

Now, let's compare each given sequence with the steps of Kruskal's algorithm:

Sequence (b,e)(e,f)(b,c)(a,c)(f,g)(c,d):

1. (b,e): This edge can be added to the minimum spanning tree.
2. (e,f): This edge can be added to the minimum spanning tree.
3. (b,c): This edge can be added to the minimum spanning tree.
4. (a,c): This edge can be added to the minimum spanning tree.
5. (f,g): This edge can be added to the minimum spanning tree.
6. (c,d): This edge can be added to the minimum spanning tree.

The given sequence (b,e)(e,f)(b,c)(a,c)(f,g)(c,d) is a valid sequence of edges added to the minimum spanning tree using Kruskal's algorithm.

Therefore, the answer is none of the given sequences is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm.