Consider MST-Kruskal algorithm: MST-KRUSKAL(G, w)

A = 0; for each vertex v in G, V

MAKE-SET(v)

//sort the edges of G:E into nondecreasing order by weight w for each edge (u,v) in G,E //taken in nondecreasing order by weight

if FIND-SET(u) does not equal FIND-SET(v)

A = A U {(u,v)}

Union(u,v)

return A

1. What is the exact # of times Union is called?

2. If MST-Kruskal is run without sorting the edges, what will it find?