Let \(n\) be a positive integer. Prove that it’s impossible to have a closed knight’s tour on a \(4\times n\) grid.