Answer:
To remedy confusions like yours and to avoid the needless case analyses, I prefer to define X to be countable if there is a surjection from N to X.
This definition is equivalent to a few of the many definitions of countability, so we are not losing any generality.
It is a matter of convention whether we allow finite sets to be countable or not (though, amusingly, finite sets are the only ones whose elements you could ever finish counting).
So, if A and B be countable, let f:N→A and g:N→B be surjections. Then the two sequences (f(n):n⩾1)=(f(1),f(2),f(3),…) and (g(n):n⩾1)=(g(1),g(2),g(3),…) eventually cover all of A and B, respectively; we can interleave them to create a sequence that will surely cover A∪B:
(h(n):n⩾1):=(f(1),g(1),f(2),g(2),f(3),g(3),…).
An explicit formula for h is h(n)=f((n+1)/2) if n is odd, and h(n)=g(n/2) if n is even.
Hope it helps uh mate...✌