Select all of the following facts which apply to both Prim's and Kruskal's algorithms:

Group of answer choices

can be implemented in O$($m$*$log$($n$))$ time

May have edges in more than one connected component when building solution

Never add more than n$-1$ edges to solution

Use the Cut Property in proving their correctness