If Kruskal's algorithm is performed on the graph with vertex {0,1,2,3,4,5} and adjacency matrix given below, what is the sequence of edges added to the result. We break ties between edges by picking the edge whose endpoints give the smallest sum. For example, the sum of the endpoints in the edge (2, 3) is 2+3 = 5. So, if edge (2, 3) and (4, 4) have the same weight, we choose (2, 3) first.

(0 8 5 9 6 3

8 0 2 2 5 2

5 2 0 3 1 7

9 2 3 0 1 9

6 5 1 1 0 9

3 2 7 9 9 0)

a) (0, 5), (1, 5), (1, 2), (2, 4), (3, 4)

(b) (2, 4), (3, 4), (1, 2), (1, 5), (0, 5)

(c) (2, 4), (3, 4), (1, 2), (1, 3), (1, 5)

(d) (3, 4), (2, 4), (1, 5), (1, 3), (0, 5)

(e) (0, 5), (1, 5), (1, 3), (3, 4), (2, 4)