For a graph with $n$ vertices and $m$ edges, which of the following are good comparisons for Prim's Algorithm and Kruskal's Algorithm?

The time complexity for Kruskal's Algorithm is $O(mlogm)$ while that for Prim's Algorithm can be $O(n^2+m),O(mlogn),$ or $O(m+logn)$

It is easier to write code for Prim's Algorithm as compared to Kruskal's Algorithm

Both algorithms have the same timf complexity of $O(mlogm)$

Prim's Algorithm is slower than Kruskal's Algorithm