0.11.3. Let L be a language over finite alphabet Σ. Show that if language L is infinite, then there is no upper bound on the length of words within L. (Hint: Proceed indirectly by assum- ing that L is infinite but that no word of L ex- ceeds length no, say. Derive a contradiction.)