Answer the following for the Union$-$Find data structure implemented using augmented linked lists:

The complexity of a MAKESET operation is

The complexity of a FIND operation is

You are merging two sets of sizes $x$ and $Y.$ The complexity of unionizing the two sets is

You start with $N$ sets, each containing a single element.

A$.$ The minimum number of UNION operations needed so that all the sets are merged into a single set is

B$.$ The complexity to carry out these UNION operations i