The goal of this problem is to construcet an infinite number of examples of disjoint set tree construction with the following properties: the sets are implemented as trees with union by rank and path compression, the final tree has at least n/c nodes at a depth of at least 2 for some constant c>0, where . the find operations that are done during unions are on leaves at the lowest depth of each The last restriction is what makes this problem nontrivial in the presence of path compressioin n is the number of elements. tree. effect of the path compression if it makes the math easier. The goal of this problem is to construcet an infinite number of examples of disjoint set tree construction with the following properties: the sets are implemented as trees with union by rank and path compression, the final tree has at least n/c nodes at a depth of at least 2 for some constant c>0, where . the find operations that are done during unions are on leaves at the lowest depth of each The last restriction is what makes this problem nontrivial in the presence of path compressioin n is the number of elements. tree. effect of the path compression if it makes the math easier