A small Question ,Disjoint Set ADT

Can you please help me with the below questions about disjoint SET ADT.. (Union Find algorithm) 1. Show the result of the following sequence of instructions: union(1,2), union(3,4), union(3,5), union(1,7), union(3,6), union(8,9), union(1,8), union(3,10), union(3,11), union(3,12), union(3,13), union(14,15), union(16,0), union(14,16), union(1,3), union(1,14) when the unions are performed arbitrarily. I hope the answer to this question is the above tree fig. I want answer to the below question: 2. For the tree in question 1, perform a find with path compression on the deepest node (using the information from above). Thank you.. ## Deliverables I need only the answers no source code now .. Can anybody help me with out a bid amount . But I will give the coding of this problem to you privatly ## Platform I need answers immediately .