Let and and define as follows:
This is very similar to the question in this thread.
Let and and define as follows:
This is very similar to the question in this thread.
I don't understand the point of having to exhibit the bijection. Clearly one exists since the countable union of countable sets is countable, and using this (decompose your set into the disjoint union of a countable set and an uncountable set) one can prove that if is uncountable then for any