A Show That If M N2 Then The Running

a. Show that if M = N2, then the running time of M union/find operations is O(M).
b. Show that if M = N logN, then the running time of M union/find operations is O(M).
c. Suppose M = Θ(N log logN). What is the running time of M union/find operations?
d. Suppose M = Θ(N log* N). What is the running time of M union/find operations?

Posted in Uncategorized