Prove that the set of all possible 'words' is countably infinite, where a 'word' is any finite length string made from the letters of English alphabet.