Question

for i from 1 to 60:
MakeSet(i)
for i from 1 to 30:
Union(i, 2*i)
for i from 1 to 20:
Union(i, 3*i)
for i from 1 to 12:
Union(i, 5*i)
for i from 1 to 60:
Find(i)
Assume that the disjoint sets data structure is implemented as disjoint trees with union by rank heuristic and with path compression heuristic.

Compute the maximum height of a tree in the resulting forest. (Recall that the height of a tree is the number of edges on a longest path from the root to a leaf. In particular, the height of a tree consisting of just one node is equal to 0.)

Answer 1

Answer:

kkkkkkdhuhieabcviakhe formula in cell A5=(A1+A2+A3+A4)/4. Create a similar formula in cell A6 and A7 using two different functions so that the output in A5, A6, A7 is same.pppppp ly u parth

Explanation:

Answer 2

Answer:

1

Explanation:

lets take some example i.e disjoint set of (1,2,3,4,5,6)

so after second loop (1,30):

sets will be (1,2,4) (3,6) (5)

and after third loop (1,20):

sets will be (1,2,3,4,6) (5)

after fourth loop:

set  will be (1,2,3,4,5,6) and for larger set

there will be tree of prime number and tree of number that are multiple of 2,3,5 so all will have max height of 1