Quiz: Kruskal vs Prim on Dense Graphs

For dense graphs where $E \approx V^2$, which algorithm has better time complexity?

1. A.Kruskal, because sorting edges is efficient
2. B.Prim, because $O(E \log V)$ beats $O(E \log E)$ when $E \approx V^2$
3. C.Both have the same time complexity on dense graphs
4. D.Kruskal, because Union-Find operations are nearly $O(1)$