Consider the graph. When using Kruskal's algorithm to find a minimally weighted spanning tree, what is the first numbered edge added?
a) {1,2}
b) Either of {1,2}
c) Either of {24} or {5,6}
d) {2,4}