For this problem, a word is any finite string of the 26 letters a through z, so that trumpet, xzostmugkj, and the letter q repeated a million times are all words. Show that the set W of all words is countably infinite. Moreover, it suffices to describe an infinite list that every word will appear on.