2. (Countable sets) (a) Whitespace (https://en.wikipedia.org/wiki/Whitespace_(programming_language)) is a programming language in which valid programs consist only of spaces (S), tabs (T), and linebreaks (L). Show that the set W of all (finite) Whitespace programs is countable. (For the sake of readability, you can use the symbols S,T, L to stand for legal Whitespace characters in your proof.) (b) Show that if S and T are countable sets, then their union SUT is also countable. 2. (Countable sets) (a) Whitespace (https://en.wikipedia.org/wiki/Whitespace_(programming_language)) is a programming language in which valid programs consist only of spaces (S), tabs (T), and linebreaks (L). Show that the set W of all (finite) Whitespace programs is countable. (For the sake of readability, you can use the symbols S,T, L to stand for legal Whitespace characters in your proof.) (b) Show that if S and T are countable sets, then their union SUT is also countable