What is the worst-case running time of unions done by size and path compression?

• A. O(N)
• B. O(log * N)
• C. O(N log N)
• D. O(M log* N)