Recall a set A is countable if |N| |A|. Recall that Cantors theorem shows that P(N) = {X N} is uncountable. Show that F = {X N | |X| < } is countable, with an onto function g : N F that is computable.