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(6))
    union(find(3),find(8))
    union(find(1),find(3))