Consider an n × n chessboard with n ≥ 4. Show that a knight starting at any square can visit every other square, with a move sequence that contains every possible move exactly once [a move (a, b) as well as its reverse (b, a) should be made]. Interpret this sequence as a forward Euler cycle in a suitable graph