Solution
= Solution
{c}
The hypercube is connected: successive coordinate flips reach any target bit string. Every vertex has degree $k$. A finite connected graph has an <Euler circuit> exactly when all vertex degrees are even. Therefore
$$
\boxed{Q_k\text{ is Eulerian exactly when }k\text{ is even}.}
$$