algorithms – Disjoint data structure opeartions

Consider the following set of disjoint data structures implemented using linked list (Cormen book). We assume that initial MAKE operations are
make(1), make(3), make(7), make(6), make(4), make(9), make(13), make(10), make(8), make(11), make(12).
Consider the following sequence of union operations.

Union(1,13)
Union(1,4)
Union(4,7)
Union(9,10)
Union(6,11)
Union(12,10)
Union(1,8)
Union(7,6)
Union(11,12)
Union(1,3)

Show the status of the linked list after each of the operations above when union is obtained by appending
a. the second linked list at the end of first one.
b. the shorter linked list at the end of longer linked list.

I’m not able to understand how to append the sets and what are the objects in the sets. I’m a little confused. Can anyone help me by making a linked list diagram as given in CLR?