Consider the languages cₖ defined in problem 1.60. prove that for each k, no dfa can recognize cₖ with fewer than 2ᵏ states.