3) Using a set of values from 0 to 5, perform the following unions using union-by-size. Show the result of each union. When sizes are the same, make the second tree a child of the first tree. Notice the finds return roots, and the union will union the roots. union(find(0),find(1)) union(find(3),find(4)) union(find(5),find(1)) union(find(2),find(5)) union(find(3),find(2)) 10 points

4) Illustrate the array for the final forest of the previous problem (note that roots are not simply -1 when using union-by-size).