$1\mathrm{.}61$ Consider the languages $C_k$ defined in Problem $1\mathrm{.}60.$ Prove that for each $k,$ no DFA

can recognize $C_k$ with fewer than $2^k$ states.