Website: https://github.com/haseebr/competitive-programming/blob/master/Materials/Algorithhms%204th%20Edition%20by%20Robert%20Sedgewick%2C%20Kevin%20Wayne.pdf

I have attached the book link. Please take a look. take a look in book for page 224

Exercises on Union-Find Reference: Section 1.5 in Algorithms 4/e. 1. Give the idl array and draw the corresponding forest-of-trees representation that results from the following sequence of union operations using the quick-union algorithm described starting on p. 224: 0-2, 1-4, 2-5, 3-6, 0-4, 0-6, 1-3 Assume that N equals 7. Warning: Make sure that your id] array is produced exactly as in the code on p 224-do not interchange the roles of p and