Algorithms

Reference: Section 1.5 in Algorithms 4/e. 1. Give the id] 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 idl array is produced exactly as in the code on p. 224-do not interchange the roles of p and q. (20 Points)