Data structure (This question does not involve coding) Using a set of values from 0 to 10, 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. union(find(0),find(1)) // union the two roots, one from find(0) and one from find(1) union(find(2),find(3)) union(find(4),find(5)) union(find(4),find(6)) union(find(7),find(8)) union(find(7),find(9)) union(find(7),find(10)) union(find(1),find(5)) union(find(3),find(9)) union(find(1),find(3)) Illustrate the array for the final forest of the previous problem (note that roots are not simply -1 when using union-by-size). Similar to problem 1, but using union-by-height. union(find(0),find(1)) union(find(2),find(3)) union(find(1),find(3)) union(find(4),find(5)) union(find(4),find(3)) union(find(6),find(7)) union(find(8),find(9)) union(find(9),find(10)) union(find(7),find(10)) union(find(10),find(5)) Illustrate the array for the final forest of the previous problem (note that roots are not simply -1 when using union-by-height).