What is the worst case efficiency for a path compression algorithm?

(a) O(N)

(b) O(log N)

(c) O(N log N)

(d) O(M log N)

My doubt stems from Trees in section Trees of Data Structures & Algorithms I

This question was addressed to me in homework.