Consider the minimum spanning tree constructed by the Kruskals algorithm on the following graph G=(V,E), with N=|V| and M=|E|.

Time complexity T(N,M) for the Kruskals is ___________________.

Note that the time complexity of quick sort or merge sort is k log (k) for a sequence of k numbers.

Group of answer choices

( M log N )

( N log N )

(N log M)

(M)

(N)

None is a correct answer.