Please provide a description of the algorithm and the explanation of correctness and complexity of final_sets(),thanks!

10. (programming question) Finding connected components in a binary image. a) An Union-Find data structure should be implemented, with the most efficient algorithm, as an abstract data type (a class in C++ or java) with the following operations. uand (n): constructs an union-find data type with n elements, 1, 2, ...,n. make_set(i): creates a new set whose only member and thus representative) is i. union_sets(i, j): unites the dynamic sets that contains i and j, respectively, into a new set that is the union of these two sets. find_set(i); returns the representative of the set containing i. final sels(): returns the total number of current sets and finalizes the current sets: (i) make_set() and union sets will have no effect after this operation and (ii) resets the representatives of the sets so that integers from 1 to final sets) will be used as representatives. 10. (programming question) Finding connected components in a binary image. a) An Union-Find data structure should be implemented, with the most efficient algorithm, as an abstract data type (a class in C++ or java) with the following operations. uand (n): constructs an union-find data type with n elements, 1, 2, ...,n. make_set(i): creates a new set whose only member and thus representative) is i. union_sets(i, j): unites the dynamic sets that contains i and j, respectively, into a new set that is the union of these two sets. find_set(i); returns the representative of the set containing i. final sels(): returns the total number of current sets and finalizes the current sets: (i) make_set() and union sets will have no effect after this operation and (ii) resets the representatives of the sets so that integers from 1 to final sets) will be used as representatives