3) Using a set of values from 0 to 8 as separate roots, perform the following unions using union-by-size. Show the result of each union. When sizes are the same, make the second tree be a child of the first tree. Notice the finds return roots, and a union will union two roots. union(find(0),find(2)) union(find(0),find(3)) union(find(0),find(4)) union(find(0),find(7)) union(find(1),find(5)) union(find(6),find(8)) union(find(5),find(8)) union(find(7),find(8)) 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). 15 points 5) Same as #3, but using union-by-height. When heights are the same, make the second tree be a child of the first tree. 10 points 6) Illustrate the array for the final forest of the previous problem (note that roots are not simply -1 when using union-by-height).