Each time an element is moved from one set to another, the new set is at least as large as the old one. So the set size at least doubles. Starting from size , doubling times reaches size . To reach , you need doublings.
An element cannot be moved more than times. Since there are elements total, and each moves at most times, total operations are . This is the proof of the complexity bound.
Space complexity is for the data structures used.