Suppose we have an array-based disjoint sets data structure, for which the array is (30%) [25-5...

 

Transcribed Image Text:

Suppose we have an array-based disjoint sets data structure, for which the array is (30%) [25-5 5 3 -5 2 2 3 0] a. Draw the forest that this array represents. (Each node in the forest represents an item in the range 0...9.) (10%) b. Given a sequence of union and find operations whose execution will convert the array to [2 5 -10 2 5 2 2 2 2 0]. (10%) c. Draw the tree that corresponds to the converted array in (b). (10%) Suppose we have an array-based disjoint sets data structure, for which the array is (30%) [25-5 5 3 -5 2 2 3 0] a. Draw the forest that this array represents. (Each node in the forest represents an item in the range 0...9.) (10%) b. Given a sequence of union and find operations whose execution will convert the array to [2 5 -10 2 5 2 2 2 2 0]. (10%) c. Draw the tree that corresponds to the converted array in (b). (10%)