The inclusion/exclusion principle states that
[tex]|X\cup Y|=|X|+|Y|-|X\cap Y|[/tex]
That is, the union has as many members as the sum of the number of members of the individual sets, minus the number of elements contained in both sets (to avoid double-counting).
Therefore, [tex]|X\cup Y|[/tex] will have the most elements when the sets [tex]X[/tex] and [tex]Y[/tex] are disjoint, i.e. [tex]X\cap Y=\emptyset[/tex], which would mean the most we can can in this case would be
[tex]|X\cup Y|=|X|+|Y|=22+13=35[/tex]
(Note that [tex]n(X)=|X|[/tex] denotes the cardinality of the set [tex]X[/tex].)