A drunken horse moves on an infinite board whose squares are numbered in pairs (a,b)∈Z2. In each movement, the 8 possibilities (a,b)→(a±1,b±2), (a,b)→(a±2,b±1) are equally likely. Knowing that the knight starts at (0,0), calculate the probability that, after 2023 moves, it is in a square (a,b) with a≡4(mod8) and b≡5(mod8). modular arithmeticgenerating functionsrecurrence relationalgebra